Cod sursa(job #2357399)
Utilizator | Data | 27 februarie 2019 12:53:59 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
long long ans = 0;
int a[(int) 3e6 + 5];
int main()
{
int n, k;
fin >> n >> k;
for(int i = 1; i <= n; ++i) fin >> a[i];
nth_element(a + 1, a + k, a + 1 + n);
fout << a[k];
return 0;
}