Cod sursa(job #660718)
| Utilizator | Data | 13 ianuarie 2012 12:33:36 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int a[1000005];
int main () {
int i,n,k,c=0;
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
k=n/2+1;
for(i=1;i<=n;++i)scanf("%d",&a[i]);
nth_element(a+1,a+k,a+n+1);
for(i=1;i<=n;++i){
if(a[i]==a[k]){
c=c+1;
}
}
if(c>n/2){
printf("%d %d",a[k],c);
return 0;
}
printf("-1");
return 0;
}
