Cod sursa(job #658857)
Utilizator | Data | 9 ianuarie 2012 18:34:52 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<stdio.h>
#include<algorithm>
#define MAX 3000005
using namespace std;
int a[MAX],n,k;
int main()
{ int i;
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]);
}