Cod sursa(job #1606605)
Utilizator | Data | 20 februarie 2016 13:38:30 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
vector <int> x;
int N, K;
int main()
{
fin >>N >>K;
x.resize(N+1);
for (int i = 1; i <= N; ++i)
fin >>x[i];
nth_element(x+1, x+K, x+N+1);
fout <<x[K] <<'\n';
return 0;
}