Cod sursa(job #1386096)
Utilizator | Data | 12 martie 2015 18:11:11 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,k,v[1000001],g,p,i,j,maxi
;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
if(v[i]==maxi)
p++;
else
p--;
if(p<=0)
maxi=v[i],p=1;
}
p=0;
for(i=1;i<=n;i++)
if(v[i]==maxi)
p++;
if(p>=n/2+1)
fout<<maxi<<" "<<p;
else
fout<<-1;
return 0;
}