Pagini recente » Cod sursa (job #759589) | Cod sursa (job #3276103) | Cod sursa (job #3197021) | Cod sursa (job #2569526) | Cod sursa (job #1197063)
#include <cstdio>
using namespace std;
const int nMax = 1000001;
int v[nMax];
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
int n, i=1, elem, fq=0;
for (scanf("%d",&n); i<=n; ++i) {
scanf("%d",&v[i]);
if (!fq) elem=v[i], fq=1;
else v[i]==elem ? ++fq : --fq;
}
if (!fq) { printf("-1"); return 0; }
for (fq=0,i=1; i<=n; ++i)
if (v[i]==elem) ++fq;
fq>=n/2+1 ? printf("%d %d",elem,fq) : printf("-1");
return 0;
}