Cod sursa(job #900125)
Utilizator | Data | 28 februarie 2013 17:47:35 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
vector<int> v;
int N,K;
int main()
{
int x;
f >> N >> K;
for(int i = 0; i < N; i++) {
f >> x;
v.push_back(x);
}
nth_element(v.begin(),v.begin() + K, v.end());
g << v[K - 1];
}