Cod sursa(job #527158)
Utilizator | Data | 30 ianuarie 2011 18:21:40 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
int k,n,i,a[3000000];
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",&a[i]);
//sort(a+1,a+n+1);
nth_element(a,a+k,a+n+1);
printf("%d\n",a[k]);
return 0;
}