Cod sursa(job #1753471)
Utilizator | Data | 6 septembrie 2016 16:36:01 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,i,m,c,x[1000010];
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x[i];
if(c==0)
m=x[i];
if(x[i]==m)
c++;
else
c--;
}
c=0;
for(i=1;i<=n;i++)
if(x[i]==m)
c++;
if(c>n/2)
g<<m<<' '<<c;
else
g<<"-1";
return 0;
}