Pagini recente » Cod sursa (job #2585267) | Cod sursa (job #2938958) | Cod sursa (job #439278) | Cod sursa (job #1993023) | Cod sursa (job #3247735)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int NMAX = 1000001;
int N;
int V[NMAX];
int main()
{
fin >> N;
for(int i = 0; i < N; i++)
fin >> V[i];
int contor = 0, candidat = 0, aparitii = 0;
for(int i = 0; i < N; i++)
{
if(contor == 0)
{
candidat = V[i];
contor = 1;
}
else
{
if(V[i] == candidat)
contor += 1;
else
contor -= 1;
}
}
for(int i = 0; i < N; i++)
if(V[i] == candidat)
aparitii += 1;
if(aparitii > N / 2)
fout << candidat << " " << aparitii;
else
fout << "-1";
fin.close();
fout.close();
return 0;
}