Cod sursa(job #2340675)
Utilizator | Data | 10 februarie 2019 20:17:47 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
const int NMAX=3000005;
int v[NMAX];
int main(){
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
int n,k;
scanf("%d%d", &n, &k);
for(int i=1;i<=n;i++)
scanf("%d", &v[i]);
nth_element(v+1, v+k, v+n+1);
printf("%d", v[k]);
return 0;
}