Cod sursa(job #1038301)
Utilizator | Data | 21 noiembrie 2013 12:17:35 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include<fstream>
#include<cstdlib>
#include<ctime>
#include<algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
long long v[3000005], x;
int n, k, p;
int main()
{
f>>n>>k;
for(int i=1; i<=n; ++i){
f>>v[i];
}
nth_element(v+1, v+k, v+n+1);
g<<v[k]<<'\n'; //cout<<v[k];
g.close();
return 0;
}