Cod sursa(job #1098674)
Utilizator | Data | 5 februarie 2014 00:04:24 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream is ("sdo.in");
ofstream os ("sdo.out");
int n, k;
vector <int> v;
int main()
{
is >> n >> k;
v.resize(n);
for (int i = 0; i < n; ++i)
is >> v[i];
nth_element(v.begin(), v.begin()+k-1, v.end());
os << v[k-1] << '\n';
is.close();
os.close();
return 0;
}