Pagini recente » Cod sursa (job #1760778) | Cod sursa (job #1278068) | Cod sursa (job #2681663) | Cod sursa (job #1004877) | Cod sursa (job #1991840)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int v[1000001];
int main()
{
int n, pretendent, aparitie, k=0;
fin>>n;
for (int i=1;i<=n;++i)
fin>>v[i];
pretendent=v[1];
aparitie=1;
for (int i=2;i<=n;++i)
{
if (pretendent==v[i])
{
aparitie++;
}
else
{
aparitie--;
if (aparitie==0)
{
pretendent=v[i];
aparitie++;
}
}
}
for (int i=1;i<=n;++i)
if (pretendent==v[i])
k++;
if (k>=n/2+1)
fout<<pretendent<< " "<<k;
else
fout<<-1;
}