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