Cod sursa(job #1624153)
Utilizator | Data | 2 martie 2016 08:36:19 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
vector<int> x;
int N,K;
int main()
{
fin>>N>>K;
x.resize(N+1);
for(int i=1;i<=N;i++)
fin>>x[i];
nth_element(x.begin()+1, x.begin()+K, x.begin()+N+1);
fout<<x[K]<<'\n';
return 0;
}