Cod sursa(job #1410733)
| Utilizator | Data | 31 martie 2015 11:31:02 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
#include<cstdio>
using namespace std;
int a[1000002],nr,el,i,n;
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
el=a[i];
nr=1;
for(i=2;i<=n;i++)
{
if(a[i]==el)
{
nr++;
}
else
{
nr--;
}
if(nr<0)
{
el=a[i];
nr=1;
}
}
nr=0;
for(i=1;i<=n;i++)
{
if(a[i]==el)
{
nr++;
}
}
if(nr>=n/2+1)
{
printf("%d %d\n",el,nr);
}
else
{
printf("-1\n");
}
return 0;
}
