Cod sursa(job #542577)
Utilizator | Data | 26 februarie 2011 15:50:58 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#define MAX_N 3000005
using namespace std;
const char iname[]="sdo.in";
const char oname[]="sdo.out";
int V[MAX_N],n,k;
void citire()
{
ifstream in(iname);
in >> n >> k;
for(int i=1;i<=n;++i)
in >> V[i];
in.close();
}
int main()
{
citire();
nth_element(V+1,V+k,V+n+1);
ofstream out(oname);
out << V[k];
out.close();
return 0;
}