Cod sursa(job #495252)
Utilizator | Data | 24 octombrie 2010 16:29:59 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 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;
}