Cod sursa(job #1080935)
Utilizator | Data | 12 ianuarie 2014 23:45:33 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<algorithm>
#include<fstream>
#define maxn 3000005
using namespace std;
ifstream fi("sdo.in");
ofstream fo("sdo.out");
int i,n,k,a[maxn];
int main(){
fi>>n>>k;
for(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;
}