Cod sursa(job #2690358)
Utilizator | Data | 23 decembrie 2020 18:12:39 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n, k;
int v[3000005];
int x;
int main(){
f >> n >> k;
for (int i = 1; i <= n; i++) {
f >> v[i];
}
nth_element(v + 1, v + k, v + n + 1);
g << v[k];
return 0;
}