Cod sursa(job #1471865)
Utilizator | Data | 15 august 2015 14:25:40 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int s[3000001], n, k;
int main()
{
fin >> n >> k;
for (int i = 1; i<=n; i++)fin >> s[i];
nth_element(s + 1, s + k, s + n + 1);
fout << s[k];
return 0;
}