Cod sursa(job #1324663)
Utilizator | Data | 22 ianuarie 2015 17:43:58 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
#define NMAX 3000005
int N,K,Sol,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;
}