Pagini recente » Cod sursa (job #1510782) | Cod sursa (job #1553271) | Cod sursa (job #920166) | Cod sursa (job #1830831) | Cod sursa (job #1649786)
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int i,n,v[1000002],k,nr,cand;
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>v[i];
cand=-1;k=0;
for(i=1;i<=n;i++)
{
if(k==0) {cand=v[i];k=1;}
else if(cand==v[i]) k++;
else k--;
}
if(cand==-1) g<<0<<'\n';
int nr=0;
for(i=1;i<=n;i++) if(v[i]==cand) nr++;
if(nr>=n/2+1) g<<cand<<' '<<nr<<'\n';
else g<<-1<<'\n';
f.close();
g.close();
return 0;
}