Cod sursa(job #1758219)
Utilizator | Data | 16 septembrie 2016 19:54:21 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int n,k;
int v[3000002];
int main()
{
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
scanf("%d", &n);
scanf("%d", &k);
for(int i = 1; i <= n; ++i)
{
int val;
scanf("%d", &v[i]);
}
nth_element(v+1,v+k,v+n+1);
printf("%d\n", v[k]);
return 0;
}