Cod sursa(job #563139)
Utilizator | Data | 24 martie 2011 15:32:56 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
#include<algorithm>
using namespace std;
#define maxN 3000005
ifstream f("sdo.in");
ofstream g("sdo.out");
int N,K,i,A[maxN];
int main () {
f >> N >> K;
for ( i = 1 ; i <= N ; ++i ){
f >> A[i];
}
nth_element(A+1,A+K,A+N+1);
g << A[K];
f.close();
g.close();
return 0;
}