Pagini recente » Cod sursa (job #3234066) | Cod sursa (job #2920609) | Cod sursa (job #2059506) | Cod sursa (job #70143) | Cod sursa (job #1657309)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int LIM = 1000005;
int N;
int V[LIM];
void Read()
{
fin >> N;
for(int i = 0; i < N; i++)
fin >> V[i];
int _const = 0, candidat = 0, appears = 0;
for(int i = 0; i < N; i++)
{
if(_const == 0)
{
candidat = V[i];
_const = 1;
}
else
{
if(V[i] == candidat)
_const += 1;
else
_const -= 1;
}
}
for(int i = 0; i < N; i++)
if(V[i] == candidat)
appears += 1;
if(appears < N / 2 + 1)
fout << "-1";
else
fout << candidat << " " << appears;
}
int main()
{
Read();
return 0;
}