Pagini recente » Cod sursa (job #1445925) | Cod sursa (job #683242) | Cod sursa (job #2894631) | Cod sursa (job #1257368) | Cod sursa (job #3279512)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long int a[1000001];
int main()
{
int n, nr = 0, cand = -1, i;
f >> n;
for(i = 1; i <= n; i++)
{
f >> a[i];
if(nr == 0)
{
cand = a[i];
nr = 1;
}
else
if(a[i] == cand)
nr++;
else
nr--;
}
if(nr == 0)
g << -1;
else
{
nr = 0;
for(i = 1; i <= n; i++)
{
if(cand == a[i])
nr++;
}
if(nr > n / 2)
g << cand << ' ' << nr;
else
g << -1;
}
f.close();
g.close();
return 0;
}