Cod sursa(job #840529)
Utilizator | Data | 22 decembrie 2012 20:44:51 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
const int nmax = 3000005;
int n,k,a[nmax],i;
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]);
nth_element(a+1,a+k,a+n+1);
printf("%d\n",a[k]);
return 0;
}