Cod sursa(job #1770640)
Utilizator | Data | 4 octombrie 2016 18:01:37 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int n,k, v[3000002];
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int main()
{
fin >> n >> k;
for(int i = 1; i <= n; ++i)
fin >> v[i];
nth_element(v + 1, v+k, v + n + 1);
fout << v[k] << "\n";
return 0;
}