Cod sursa(job #2419922)
Utilizator | Plaiasu Iulia-Silvia Mortem | Data | 9 mai 2019 20:26:52 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
std::ifstream fin("sdo.in");
std::ofstream fout("sdo.out");
int n,k;
std::vector<int> v;
int main()
{
fin>>n>>k;
v = std::vector<int> (n);
for(int i=0;i<n;i++)
fin>>v[i];
std::nth_element(v.begin(),v.begin()+k-1,v.begin()+n);
// std::sort(v.begin(),v.begin()+n);
fout<<v[k-1];
}