Pagini recente » Cod sursa (job #3219188) | Cod sursa (job #3141044) | Cod sursa (job #2758270) | Cod sursa (job #1116847) | Cod sursa (job #2393171)
#include <bits/stdc++.h>
using namespace std;
ifstream f ( "elmaj.in" ); ofstream g ( "elmaj.out" );
int n,v[1000007];
int main()
{ f>>n;
for(int i=1;i<=n;i++) f>>v[i];
int nrap=1,candidat=v[1];
for(int i=2;i<=n;i++)
{ if(v[i]==candidat) nrap++;
else nrap--;
if(nrap<0)
{ nrap=1;
candidat=v[i];
}
}
nrap=0;
for(int i=1;i<=n;i++)
if(v[i]==candidat) nrap++;
if(nrap>=n/2+1) g<<candidat<< ' '<<nrap; else g<<-1;
return 0;
}