Pagini recente » Cod sursa (job #515841) | Cod sursa (job #1627396) | Cod sursa (job #2074673) | Cod sursa (job #2670813) | Cod sursa (job #1889980)
#include <cstdio>
using namespace std;
const int nmx = 1000002;
int n,v[nmx];
int main()
{
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
int maj = -1, ap = 0;
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
{
scanf("%d", &v[i]);
if(v[i] != maj)
{
if(ap > 0)
-- ap;
else
{
ap = 1;
maj = v[i];
}
}
else
++ ap;
}
int cate = 0;
for(int i = 1; i <= n; ++i)
if(v[i] == maj)
++ cate;
if(cate >= (n/2) + 1)
printf("%d %d\n", maj, cate);
else
printf("-1\n");
return 0;
}