Cod sursa(job #695374)
| Utilizator | Data | 28 februarie 2012 12:07:14 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
const int N = 3000005;
int n, k, a[N];
void citire() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
}
int main() {
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
citire();
nth_element(a + 1, a + k, a + n + 1);
printf("%d\n", a[k]);
return 0;
}
