Pagini recente » Cod sursa (job #2972800) | Cod sursa (job #2619906) | Cod sursa (job #2948164) | Cod sursa (job #3176312) | Cod sursa (job #1546083)
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n;
int a[1000005];
int main()
{
int i,candidat,k;
in>>n;
for(i=1;i<=n;i++) in>>a[i];
candidat=a[1];
k=1;
for(i=2;i<=n;i++)
{
if(a[i]==candidat) k++;
else k--;
if(k==0)
{
candidat=a[i];
k=1;
}
}
k=0;
for(i=1;i<=n;i++)
if(a[i]==candidat) k++;
if(k>=n/2+1) out<<candidat<<" "<<k;
else out<<"-1";
in.close();
out.close();
return 0;
}