Cod sursa(job #984371)
Utilizator | Data | 14 august 2013 12:31:21 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
using namespace std;
#include <fstream>
#include<algorithm>
#define NMax 3000005
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int N,K,X[NMax];
int main()
{
fin>>N>>K;
for(int i=1;i<=N;i++)
{
fin>>X[i];
}
nth_element(X+1,X+K+1,X+N+1);
fout<<X[(N+1)/2];
return 0;
}