Cod sursa(job #866389)
Utilizator | Data | 27 ianuarie 2013 23:00:35 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("sdo.in"); ofstream g("sdo.out");
int n, k, x[3000001];
int main()
{ f>>n>>k;
for(int i=1; i<=n; ++i) f>>x[i];
nth_element(x+1,x+k,x+n+1);
g<<x[k]<<'\n'; g.close(); return 0;
}