Cod sursa(job #634334)
Utilizator | Data | 15 noiembrie 2011 22:53:54 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
#define maxn 1000001
int v[maxn],n;
int main (void)
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
int i,x,max=0,p;
for(i=0;i<n;i++) { scanf("%d",&x); v[x]++; if(v[x]>max) max=v[x]; p=x;}
printf("%d %d",p,v[p]);
return 0;
}