Pagini recente » Cod sursa (job #1299997) | Cod sursa (job #2946887) | Monitorul de evaluare | Cod sursa (job #1912963) | Cod sursa (job #3196314)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");
long long v[1000001];
int main()
{
long long n, cnt = 1, cand;
fin >> n;
for (long long i = 1; i <= n; i ++)
fin >> v[i];
cand = v[1];
for (long long i = 2; i <= n; i ++)
{
if (!cnt) cand = v[i];
if (v[i] == v[i-1]) cnt ++;
else
cnt --;
}
cnt = 0;
for (long long i = 1; i <= n; i ++)
if (v[i] == cand) cnt ++;
if (cnt > n / 2) fout << cand << ' ' << cnt;
else
fout << "-1";
return 0;
}