Cod sursa(job #1181786)
Utilizator | Data | 3 mai 2014 17:39:24 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
/*
Keep It Simple!
*/
#include<fstream>
#include<algorithm>
using namespace std;
int N,K,v[3000005];
int main()
{
ifstream f("sdo.in");
ofstream g("sdo.out");
f >> N >> K;
for(int i=1;i<=N;i++) f >> v[i];
nth_element(v+1,v+K,v+1+N);
g << v[K];
}