Pagini recente » Cod sursa (job #220380) | Cod sursa (job #314402) | Istoria paginii runda/vestitorul_primaverii/clasament | Istoria paginii runda/suntpelesamoaramie | Cod sursa (job #3194269)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, v[100001], cnt=0, maxi=-1, maxii, C;
int main()
{
fin>>n;
for(int i=1;i<=n;i++){
fin>>v[i];
}
C=v[1];
for(int i=1;i<=n;i++){
if(v[i]==C){
cnt++;
}
else{
cnt--;
}
if(cnt==0){
C=v[i];
cnt=1;
}
}
cnt=0;
for(int i=1;i<=n;i++){
if(v[i]==C){
cnt++;
}
}
if(cnt>n/2){
fout<<C<<" "<<cnt;
}
else{
fout<<-1;
}
return 0;
}