Cod sursa(job #542498)
Utilizator | Data | 26 februarie 2011 14:20:17 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
#include <algorithm>
#define MAX_N 3000005
using namespace std;
int V[MAX_N],n,k;
void citire()
{
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]);
}
int main()
{
citire();
nth_element(V+1,V+k,V+n+1);
printf("%d",V[k]);
return 0;
}