Cod sursa(job #375227)
| Utilizator | Data | 19 decembrie 2009 22:08:10 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
#include<algorithm>
using namespace std;
#define MAXN 3000009
int a[MAXN];
int main(){
unsigned int n, k, i;
ifstream f("sdo.in");
f>>n>>k;
for(i=0;i<n;i++)
f>>a[i];
nth_element(a, a+k-1, a+n);
f.close();
ofstream g("sdo.out");
g<<a[k-1]<<'\n';
g.close();
return 0;
}
