Cod sursa(job #2479677)
Utilizator | Data | 24 octombrie 2019 10:50:25 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
const int NMax = 3000000;
int X[NMax + 5], N, K;
int main(){
in >> N >> K;
for (int i = 1; i <= N; i++)
in >> X[i];
nth_element(X + 1, X + K, X + N + 1);
out << X[K] << '\n';
return 0;
}