Cod sursa(job #1265462)
Utilizator | Data | 17 noiembrie 2014 12:44:42 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
const int NMAX = 3000010;
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+1,v+N+1);
g << v[K];
f.close();
g.close();
return 0;
}