Cod sursa(job #2306265)
| Utilizator | Data | 21 decembrie 2018 21:00:07 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <algorithm>
#include <fstream>
#include <vector>
#define nmax 500005
using namespace std;
int n,k;
vector <int> v;
int main()
{
ifstream f("sdo.in");
ofstream g("sdo.out");
f >> n >> k;
int j;
for (int i = 1; i <= n; ++i) {
f >> j;
v.push_back(j);
}
nth_element(v.begin(), v.begin() + k - 1, v.end());
g << v[k - 1];
return 0;
}