Pagini recente » Cod sursa (job #2564019) | Cod sursa (job #1302290) | Cod sursa (job #2852634) | Cod sursa (job #230735) | Cod sursa (job #1131873)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int a[1000005],n,sol;
void citire()
{
f>>n;
for(int i=1;i<=n;i++) f>>a[i];
}
void solve()
{
int em=-1,k=0;
for(int i=1;i<=n;i++)
if(k==0)
{
em=a[i];
k=1;
} else if(a[i]==em) k++; else k--;
if(em==-1) return;
for(int i=1;i<=n;i++)
{
if(a[i]==em) sol++;
}
if(sol>=n/2+1) g<<em<<" "<<sol;else g<<-1;
}
int main()
{
citire();
solve();
return 0;
}