Cod sursa(job #716294)
| Utilizator | Data | 18 martie 2012 16:02:40 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.25 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,i,k,a[3000001];
int main()
{f>>n>>k;
for(i=0;i<n;++i)
f>>a[i];
sort(a,a+n);
g<<a[k-1]<<'\n';
f.close();
g.close();
return 0;
}