Cod sursa(job #2337745)
Utilizator | Data | 6 februarie 2019 18:05:00 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3000005;
int v[MAXN];
int main()
{
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n, k;
fin >> n >> k;
for(int i = 1; i <= n; ++i)
fin >> v[i];
sort(v + 1, v + n + 1);
fout << v[k];
return 0;
}