Cod sursa(job #641962)
Utilizator | Naiba Mihai Lucian DeadEye | Data | 30 noiembrie 2011 05:19:04 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<cstdio>
#include<algorithm>
const int maxN=3000010;
using namespace std;
int v[maxN];
int main()
{
int n,k;
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
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\n",v[k]);
return 0;
}
/*
Aigis: *headdesk*
*/