Pagini recente » Cod sursa (job #2627553) | Cod sursa (job #2722023) | Cod sursa (job #875209) | Cod sursa (job #3218370) | Cod sursa (job #2306826)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int v[1000005];
int main()
{
int n, e = 0, nr = 0;
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> v[i];
if (v[i] == e)
nr++;
else
nr--;
if (nr == -1)
{
e = v[i];
nr = 1;
}
}
int k = 0;
for (int i = 1; i <= n; i++)
if (v[i] == e)
k++;
if (k < n / 2 + 1)
fout << -1 << '\n';
else
fout << e << ' ' << k << '\n';
return 0;
}