Cod sursa(job #896685)
| Utilizator | Data | 27 februarie 2013 16:46:30 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <cstdio>
using namespace std;
int n,x[1000001];
void citire()
{
freopen("elmaj.in","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&x[i]);
}
int solve()
{
int elem,nr=0;
for(int i=1;i<=n;++i)
{
if(nr==0)
{
elem=x[i];
nr++;
}
if(elem!=x[i])
nr--;
}
return elem;
}
int main()
{
citire();
int elem=solve();
freopen("elmaj.out","w",stdout);
printf("%d ",elem);
int nr_apar=0;
for(int i=1;i<=n;++i)
if(x[i]==elem)
nr_apar++;
printf("%d ",nr_apar);
return 0;
}
