Cod sursa(job #1411718)
Utilizator | Data | 31 martie 2015 21:42:53 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<cstdio>
#include<algorithm>
#include<cstring>
#define Nmax 3000005
using namespace std;
int v[Nmax],i,k,n;
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d %d",&n,&k);
for (i=1;i<=n;i++)
scanf("%d",&v[i]);
nth_element(v+1,v+k,v+n+1);
printf("%d",v[k]);
return 0;
}