Cod sursa(job #1382762)
Utilizator | Data | 9 martie 2015 15:34:35 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
#include <vector>
std::ifstream be ("sdo.in");
std::ofstream ki ("sdo.out");
std::vector<int> x;
int n, k;
int main()
{
be >> n >> k;
x.resize (n);
for (int i=0; i<n; i++) be >> x[i];
std::nth_element (x.begin(), x.begin()+k-1, x.end());
ki << x[k-1];
}