Pagini recente » Cod sursa (job #407119) | Cod sursa (job #2718048) | Cod sursa (job #945864) | Cod sursa (job #1446752) | Cod sursa (job #3277940)
#include <fstream>
#include <map>
#include <cmath>
#include <vector>
#include <algorithm>
#include <bitset>
#define int long long
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int v[1000005],n;
void Maj() {
int c = 0, can = 0, ap = 0;
for (int i=0; i<n; i++) {
if (c == 0) {
can = v[i];
c ++;
}
else {
if (v[i] == can) {
c++;
}
else {
c--;
}
}
}
for (int i=0; i<n; i++) {
if (v[i] == can) {
ap++;
}
}
if (ap < n/2 + 1) cout<<-1;
else cout<<can << " " << ap;
}
signed main(){
cin>>n;
for (int i=0; i<n; i++) {
cin>>v[i];
}
Maj();
}