Cod sursa(job #660633)
Utilizator | Data | 13 ianuarie 2012 11:45:29 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
#include<algorithm>
using namespace std;
int a[1000005];
int main () {
int i,n,c=1;
scanf("%d",&n);
for(i=1;i<=n;++i)scanf("%d",&a[i]);
sort(a+1,a+n+1);
for(i=1;i<n;++i){
if(a[i]==a[i+1]){
c=c+1;
}else{
if(c>=n/2){
printf("%d %d",a[i],c);
return 0;
}
c=1;
}
}
printf("-1");
return 0;
}