Pagini recente » Cod sursa (job #1464221) | Cod sursa (job #1789464) | Cod sursa (job #7993) | Cod sursa (job #13132) | Cod sursa (job #3277699)
#include <iostream>
#include <fstream>
using namespace std;
int a[1000000];
int main()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n = 0;
int cnt = 0;
int candidate = 0;
int frequency = 0;
fin >> n;
for (int i = 0; i < n; i++)
{
fin >> a[i];
if (cnt == 0)
{
candidate = a[i];
cnt = 1;
}
else
{
if (a[i] == candidate) {cnt++;}
else {cnt--;}
}
}
for (int i = 0; i < n; i++)
{
if (a[i] == candidate)
{
frequency++;
}
}
if (frequency < n / 2 + 1) {fout << -1;}
else {fout << candidate << ' ' << frequency;}
}