Cod sursa(job #3252085)
Utilizator | Data | 28 octombrie 2024 14:06:16 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int v[3000001];
int main()
{
int n, k;
fin >> n >> k;
for(int i = 1; i <= n; i++){
fin >> v[i];
}
nth_element(v + 1, v + k, v + n + 1);
fout << v[k];
return 0;
}