Cod sursa(job #1503389)
| Utilizator | Data | 16 octombrie 2015 00:20:01 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const int MAXN = 3000001;
int n, k, a[MAXN];
int main()
{
#ifdef LOCAL
freopen("input", "r", stdin);
#else
ifstream cin("sdo.in");
ofstream cout("sdo.out");
#endif // LOCAL
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
nth_element(a + 1, a + k, a + n + 1);
cout << a[k];
return 0;
}
