Cod sursa(job #628709)
Utilizator | Data | 1 noiembrie 2011 22:33:23 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int n , k , v[3000001];
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d",&n);
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;
}