Pagini recente » Cod sursa (job #1723543) | Cod sursa (job #1878779) | Cod sursa (job #1622079) | Cod sursa (job #1185132) | Cod sursa (job #1844087)
#include <fstream>
#define maxn 1000002
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, v[maxn];
void read()
{
fin >> n;
for (int i = 1; i <= n; i++)
fin >> v[i];
}
void solve()
{
int k = 0, cand = -1, nr = 0;
for (int i = 1; i <= n; i++)
if (k == 0) {
k = 1;
cand = v[i];
}
else if (cand == v[i])
k++;
else
k--;
if (k == 0) {
fout << -1;
return;
}
for (int i = 1; i <= n; i++)
if (v[i] == cand)
nr++;
if (nr > n / 2)
fout << cand << ' ' << nr;
else
fout << -1;
}
int main()
{
read();
solve();
return 0;
}