Cod sursa(job #2943479)
Utilizator | Data | 21 noiembrie 2022 00:26:13 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
#define MAX 3000002
using namespace std;
int n,a[MAX],k;
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+n+1);
fout << a[k];
return 0;
}