Cod sursa(job #373471)
Utilizator | Data | 13 decembrie 2009 21:14:03 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fi("sdo.in");
ofstream fo("sdo.out");
int N,A[3000010],k;
int main(){
fi>>N>>k;
for (int i=1;i<=N;++i) fi>>A[i];
nth_element(A+1,A+k,A+N+1);
fo<<A[k];
fi.close();fo.close();
return 0;
}