Cod sursa(job #2095150)
| Utilizator | Data | 27 decembrie 2017 00:18:40 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
int n, k;
vector <int> v;
int main()
{
ifstream fin("sdo.in");
ofstream fout("sdo.out");
fin >> n >> k;
int x;
for (int i = 1;i <= n;++i)
{
fin >> x;
v.push_back(x);
}
nth_element(v.begin(), v.begin() + k - 1, v.end());
fout << v[k - 1] << "\n";
fin.close();
fout.close();
return 0;
}
