Cod sursa(job #2058845)
Utilizator | Data | 6 noiembrie 2017 11:38:49 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
long long int v[3000005];
int k, n;
int main()
{
int i;
fin >> n >> k;
for (i = 1; i <= n; i++)
fin >> v[i];
sort(v + 1, v + 1 + n);
fout << v[k] << '\n';
return 0;
}