Cod sursa(job #2350300)
Utilizator | Data | 21 februarie 2019 10:55:15 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <bits/stdc++.h>
int n, k, a[3000001];
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int main()
{
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;
}