Cod sursa(job #1308479)
Utilizator | Data | 4 ianuarie 2015 06:42:51 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int i, n, m, v[3000010], k;
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;
}