Cod sursa(job #1329176)
Utilizator | Data | 29 ianuarie 2015 10:14:16 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
#include <algorithm>
#define NMAX 3000002
using namespace std;
int v[NMAX];
int n;
int main(){
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
int n,k;
scanf("%d %d",&n,&k);
for(int i=1;i<=n;++i)
scanf("%d",&v[i]);
nth_element(v,v+k,v+n);
printf("%d\n",v[k]);
return 0;
}