Pagini recente » Cod sursa (job #1018666) | Profil Ditsuki | Cod sursa (job #1253367) | Cod sursa (job #1639119) | Cod sursa (job #1570201)
#include <bits/stdc++.h>
#define maxN 1000002
using namespace std;
int n, m, v[maxN], ap, no;
void read()
{
freopen("elmaj.in", "r", stdin);
scanf("%d", &n);
}
void solve()
{
int i;
for (i = 1; i <= n; ++ i)
{
scanf("%d", &v[i]);
if (ap == 0)
no = v[i];
if (no == v[i])
++ ap;
else
-- ap;
}
ap = 0;
for (i = 1; i <= n; ++ i)
if (v[i] == no)
++ ap;
}
void write()
{
freopen("elmaj.out", "w", stdout);
if (ap * 2 < n)
printf("-1");
else
printf("%d %d", no, ap);
}
int main()
{
read();
solve();
write();
return 0;
}