Pagini recente » Istoria paginii problema/hoata | Crescator3 | Diferente pentru problema/prieteni2 intre reviziile 36 si 37 | Profil programator Brainfu*k profesionist | Cod sursa (job #1078045)
#include <cstdio>
int v[1000009];
int main()
{
int n, el, count = 0;
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &v[i]);
for (int i = 1; i <= n; ++i)
if (!count)
el = v[i], ++count;
else
if (v[i] == el)
++count;
else
--count;
count = 0;
for (int i = 1; i <= n; ++i)
if (v[i] == el)
++count;
if (count >= n / 2 + 1)
printf("%d %d\n", el, count);
else
printf("-1\n");
return 0;
}