Cod sursa(job #2355586)
Utilizator | Data | 26 februarie 2019 10:18:05 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
int n,k;
vector<int>v;
int main()
{
in>>n>>k;
v.push_back(0);
for(int i = 1; i <= n; i++){
int x;
in>>x;
v.push_back(x);
}
nth_element(v.begin(),v.begin() + k,v.end());
out<<v[k];
return 0;
}