Pagini recente » Cod sursa (job #1872912) | Cod sursa (job #928344) | Profil florinhaja | Cod sursa (job #2236166) | Cod sursa (job #2008107)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int NMAX = 1000000 + 5;
int n;
int v[NMAX];
void read()
{
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> v[i];
}
int main()
{
int cand = -1, k = 0, cnt = 0;
read();
for (int i = 1; i <= n; ++i)
if (k == 0)
{
cand = v[i];
k = 1;
}
else if (cand == v[i])
++k;
else
--k;
if (cand < 0)
fout << -1;
for (int i = 1; i <= n; ++i)
if (cand == v[i])
++cnt;
if (cnt > n / 2)
fout << cand << " " << cnt;
else
fout << -1;
return 0;
}