Cod sursa(job #892167)
| Utilizator | Data | 25 februarie 2013 22:40:57 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
#define Nmax 3000002
int N, K;
int v[Nmax];
void citire(){
freopen("sdo.in", "r", stdin);
scanf("%d %d", &N, &K);
for(int i = 1; i <= N; ++i)
scanf("%d", v + i);
fclose(stdin);
}
void afis(){
freopen("sdo.out", "w", stdout);
printf("%d\n", v[K]);
fclose(stdout);
}
int main(){
citire();
nth_element(v + 1, v + K, v + N + 1);
afis();
return 0;
}
