Cod sursa(job #2901255)
Utilizator | Data | 13 mai 2022 14:37:19 | |
---|---|---|---|
Problema | Hashuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <algorithm>
#include <vector>
#define MAX 3000010
using namespace std;
int main(){
ifstream fin;
ofstream fout;
fin.open("sdo.in");
fout.open("sdo.out");
int k, n, x;
vector<int> v;
fin >> n >> k;
for(int i=0; i < n; ++i){
fin >> x;
v.push_back(x);
}
nth_element(v.begin(), v.begin() + k - 1, v.end());
fout << v[k - 1];
}