Cod sursa(job #1442992)
Utilizator | Data | 26 mai 2015 17:19:46 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int i,n,v[1000010],cnt,m;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
if(!cnt)
{
m=v[i];
cnt=1;
continue;
}
if(v[i]==m)
cnt++;
else cnt--;
}
for(i=1,cnt=0;i<=n;i++)
if(v[i]==m)
cnt++;
if(cnt>n-cnt)
{
g<<m<<' '<<cnt<<'\n';
return 0;
}
g<<"-1\n";
return 0;
}