Cod sursa(job #2308951)
Utilizator | Data | 28 decembrie 2018 02:55:14 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
unsigned int a[3000002];
int main()
{
int n, k;
fin >> n >> k;
for (int i = 0; i < n; i++)
fin >> a[i];
nth_element(a, a+k-1, a+n);
fout << a[k-1] << "\n";
return 0;
}