Cod sursa(job #1624167)
Utilizator | Data | 2 martie 2016 08:42:41 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include<algorithm>
#include<vector>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
unsigned int n,k;
vector <int> v;
int main()
{
f>>n>>k;
v.resize(n);
for(int i=0;i<n;++i)
{
f>>v[i];
}
nth_element(v.begin(),v.begin()+k-1,v.end());
g<<v[k-1];
}