Pagini recente » Cod sursa (job #1296092) | Cod sursa (job #971114) | Cod sursa (job #2261431) | Cod sursa (job #1360930) | Cod sursa (job #2956028)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long n, i, candidate, cnt, c, a[100002];
int main()
{
f >> n;
for(i = 1; i <= n; i++)
f >> a[i];
for(i = 1; i <= n; i++)
{
if(c == 0)
candidate = a[i], c++;
else if(candidate == a[i])
c++;
else
c--;
}
if(c == 0)
g << -1;
else
{
for(i = 1; i <= n; i++)
if(a[i] == candidate)
cnt++;
if(cnt > n / 2)
g << candidate << " " << cnt;
else
g << -1;
}
return 0;
}