Cod sursa(job #1039211)
Utilizator | Data | 22 noiembrie 2013 18:00:11 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <cstdio>
#include <algorithm>
#define Nmax 3000001
using namespace std;
int v[Nmax],n,k,i;
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]);
sort(v+1,v+n+1);
printf("%d",v[k]);
return 0;
}