Cod sursa(job #2184320)
Utilizator | Data | 23 martie 2018 22:21:39 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int a[3000010];
int main()
{
int n, k;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
fin >> n >> k;
for (int i=0; i<n; i++)
fin >> a[i];
nth_element(a+0, a+k-1, a+n);
fout << a[k-1];
return 0;
}