Cod sursa(job #373149)
Utilizator | Data | 12 decembrie 2009 19:49:04 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
int n,k,i,v[3000001];
void read(),solve();
int main()
{
read();
solve();
return 0;
}
void read()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d%d",&n,&k);k--;
for(i=0;i<n;i++)
scanf("%d",&v[i]);
}
void solve()
{
nth_element(v,v+k,v+n);
printf("%d\n",v[k]);
}