Cod sursa(job #716089)
Utilizator | Data | 18 martie 2012 12:04:50 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <cstdio>
#include<algorithm>
using namespace std;
const int MAX_N = 3000002 ;
int n,k;
int v[MAX_N];
int main()
{
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]);
}