Cod sursa(job #690136)
Utilizator | Data | 25 februarie 2012 11:34:44 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<cstdio>
#include<map>
using namespace std;
int n,x,nr;
map <int,int> M;
int main()
{freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
int mij=n/2+1;
for(int i=1;i<=n;i++) {scanf("%d",&x);
M[x]++;
if(M[x]>=mij) nr=x;
}
printf("%d %d\n",nr,M[x]);
return 0;
}