Cod sursa(job #2342172)
Utilizator | Data | 12 februarie 2019 17:16:17 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const int Maxx=3e6+1;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n,A[Maxx],i,k;
int main() {
fin>>n>>k;
for (i=1;i<=n;++i){
fin>>A[i];
}
nth_element(A+1,A+k,A+n+1);
fout<<A[k];
return 0;
}