Pagini recente » Cod sursa (job #2640826) | Cod sursa (job #1975407) | Cod sursa (job #3136080) | Cod sursa (job #2460647) | Cod sursa (job #2917202)
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
using namespace std;
ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");
const int MAX_N = 1e6 + 5;
int n, v[MAX_N];
int pretender, frequency = 0;
int main (){
ios_base::sync_with_stdio(false);
fin.tie(nullptr), fout.tie(nullptr);
fin>>n;
for(int i=1; i<=n; i++){
fin>>v[i];
if(frequency == 0){
pretender = v[i];
frequency = 1;
}else{
if(pretender == v[i])
frequency++;
else
frequency--;
}
}
frequency = 0;
for(int i=1; i<=n; i++)
frequency += (pretender == v[i]);
if(frequency >= n/2+1)
fout<<pretender<<" "<<frequency;
else
fout<<-1;
return 0;
}