Cod sursa(job #1387250)
Utilizator | Data | 13 martie 2015 21:12:22 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
#include <algorithm>
using namespace std;
long n, k, v[3000005];
int main()
{
ifstream in("sdo.in");
ofstream out("sdo.out");
in>>n>>k;
for(long i=0; i<n; ++i) in>>v[i];
nth_element(v, v+k-1, v+n);
out<<v[k-1];
return 0;
}