Cod sursa(job #820046)
Utilizator | Ion Vlad-Doru vlad.doru | Data | 19 noiembrie 2012 23:13:17 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#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);
int maj=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;
}