Cod sursa(job #662943)
Utilizator | Data | 17 ianuarie 2012 14:02:51 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
long long i,n,x,max1,o;
long a[4100005];
int main(){
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;max1=0;
for (i=1;i<=n;i++){
f>>x;
if (x>max1) max1=x;
a[x]++;
}
o=-1;
for (i=0;i<=max1;i++)
if (a[i]>=n/2+1) o=i;
if (i==-1) g<<"-1"<<"\n";
else g<<o<<" "<<a[o]<<"\n";
return 0;
}