Cod sursa(job #1122063)
Utilizator | Data | 25 februarie 2014 15:50:28 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int n, k, i,v[3000010];
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int main ()
{
fin >> n >> k;
for(i = 1; i <= n; ++i)
fin >> v[i];
nth_element(v + 1, v + k, v + n + 1);
fout << v[k];
return 0;
}