Pagini recente » Cod sursa (job #3188235) | Cod sursa (job #3178868) | Cod sursa (job #1875105) | Cod sursa (job #2776312) | Cod sursa (job #1331113)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
long long a[1000001];
int main()
{
int n,i,x,y=0,s=0;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
fin>>n;
for (i=1;i<=n;i++) fin>>a[i];
x=a[1];
for (i=2;i<=n;i++)
{
if (a[i]==x)y++;
else y--;
if (y==0) x=a[i];
}
for (i=1;i<=n;i++)
{
if (a[i]==x) s++;
}
if (s>=(n/2)+1) fout<<x<<" "<<s;
else fout<<"-1";
return 0;
}