Cod sursa(job #1414647)
Utilizator | Data | 2 aprilie 2015 20:55:40 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
const int Nmax = 3000010;
int n , k , i;
int A[Nmax];
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
for (scanf("%d %d", &n, &k), i = 1; i <= n; ++i)
scanf("%d", &A[i]);
nth_element(A + 1 , A + k , A + n + 1);
printf("%d\n", A[k]);
return 0;
}