Cod sursa(job #1016449)
Utilizator | Data | 26 octombrie 2013 11:49:45 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int N, K, a[3000005];
int main()
{
f>>N>>K;
for (int i=1; i<=N; ++i)
f>>a[i];
nth_element(a+1, a+K, a+N+1);
g<<a[K]<<'\n';
return 0;
}