Cod sursa(job #2340700)
Utilizator | Data | 10 februarie 2019 20:47:40 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
#include<algorithm>
using namespace std;
const int NMAX=3000005;
int v[NMAX];
int main(){
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n,k;
fin>>n>>k;
for(int i=1;i<=n;i++)
fin>>v[i];
sort(v+1, v+n+1);
fout<<v[k];
return 0;
}