Cod sursa(job #1365027)
Utilizator | Data | 27 februarie 2015 23:27:07 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
#include <algorithm>
#define Nmax 3000005
using namespace std;
int N,K,v[Nmax];
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]);
return 0;
}