Cod sursa(job #1116483)
Utilizator | Data | 22 februarie 2014 16:46:01 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int i,j,k,n,Sort[3000001];
int main(){
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=1;i<=n;++i)
scanf("%d",&Sort[i]);
nth_element(Sort+1,Sort+k,Sort+n+1);
printf("%d",Sort[k]);
return 0;}