Cod sursa(job #1166592)
Utilizator | Data | 3 aprilie 2014 18:08:13 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
//Statistici de ordine - O(N)
#include <fstream>
#include <algorithm>
#define Nmax 3000009
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int N,K,v[Nmax];
int main()
{
f>>N>>K;
for(int i=1;i<=N;++i)f>>v[i];
nth_element(v+1, v+K, v+N+1); //ATENTIE v+K
g<<v[K]<<'\n';
f.close();g.close();
return 0;
}