Pagini recente » Cod sursa (job #3146197) | Cod sursa (job #3129222) | Cod sursa (job #1464177) | Cod sursa (job #213126) | Cod sursa (job #1994211)
#include <fstream>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
long long A[1000005];
int main()
{
int n;
cin>>n;
long long cand;
int vot=0;
int ans=0;
for (int i=1; i<=n; i++){
cin>>A[i];
if (vot == 0){
cand =A[i];
}
if (cand == A[i]){
vot--;
}
else{
vot++;
}
}
for (int i=1; i<=n; i++){
if (A[i]==cand){
ans++;
}
}
if (ans>=(n/2)+1){
cout<<cand<<" "<<ans;
}
else{
cout<<-1;
}
return 0;
}