Cod sursa(job #881864)
Utilizator | Data | 18 februarie 2013 18:32:01 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
#define NMAX 3000001
using namespace std;
int V[NMAX],n,k;
ifstream f("sdo.in");
ofstream g("sdo.out");
int main(){
f >> n >> k;
for(register int i=1;i<=n;i++)
f >> V[i];
nth_element(V+1,V+k,V+n+1);
g << V[k];
f.close();
g.close();
return 0;
}