Cod sursa(job #1244597)
Utilizator | Data | 17 octombrie 2014 20:40:41 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
vector <int> v;
int k,N;
int main(){
f >> N >> k;
for (int i=0 ; i< N ; i++)
{
int x;
f >> x;
v.push_back(x);
}
nth_element(v.begin(),v.begin()+k,v.end());
g << v.at(k-1);
return 0;
}