Cod sursa(job #1907090)
| Utilizator | Data | 6 martie 2017 17:46:14 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
#define mod 9973
int a[1000009];
int n,r,nr,cand;
int v[999999];
long long x,nrd;
void cit()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
}
int main()
{
cit();
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if(r==0) cand=a[i];
else if(a[i]==cand)r++;
else r--;
}
if(cand<0){printf("-1"); return 0;}
for(int i=1;i<=n;i++)
if(a[i]==cand)nr++;
printf("%d %d",cand,nr);
return 0;
}
