Pagini recente » Cod sursa (job #2389685) | Cod sursa (job #2883624) | Cod sursa (job #2020949) | Cod sursa (job #1821171) | Cod sursa (job #820049)
Cod sursa(job #820049)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
const int MAX=1000100;
int v[MAX],n;
int main(){
in>>n;
int i;
for(i=1;i<=n;++i){
in>>v[i];
}
nth_element(v+1,v+n/2,v+n+1);
register int maj=v[n/2];
int ap=0;
for(i=1;i<=n;++i){
if(maj==v[i]){
ap++;
}
}
if(2*ap>=n){
out<<maj<<" "<<ap;
return 0;
}
out<<"-1";
return 0;
}