Cod sursa(job #1692186)
Utilizator | Data | 20 aprilie 2016 13:11:01 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
long n,i,wn,k,t;
f>> n;
long A[n];k=0;wn=-1;
for(i=0;i<n;i++)
f>>A[i];
for(i=0;i<n;i++)
{
if(k==0){wn=A[i];k=1;}
else if(A[i]==wn)k++;
else k--;
}
t=0;
if(wn<0){g<<"-1";return 0;}
for(i=0;i<n;i++)
if(A[i]==wn)t++;
if(t>n/2)g<< wn <<" "<< t;
else g<< "-1";
f.close();
g.close();
return 0;
}