Pagini recente » Cod sursa (job #225437) | Cod sursa (job #2372665) | Cod sursa (job #2418313) | Cod sursa (job #1157960) | Cod sursa (job #2082134)
#include <fstream>
#include <iostream>
//#include <iostream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int N = 1000001;
int v[N], n;
bool exMAJ = false;
int main()
{
int k = 0, majoritar;
fin >> n;
for( int i = 1 ; i <= n ; ++i ){
fin >> v[i];
if( k == 0 ){
majoritar = v[i];
++k;
}else if( v[i] == majoritar ) ++k;
else --k;
}
int aparitii = 0;
for( int i = 1 ; i <= n ; ++i ){
if( v[i] == majoritar ){
exMAJ = true;
++aparitii;
}
}
if( !exMAJ ) fout << -1;
else fout << majoritar << " " << aparitii;
return 0;
}