Pagini recente » Cod sursa (job #649742) | Istoria paginii runda/p1-66 | Cod sursa (job #3220927) | Istoria paginii runda/rar27/clasament | Cod sursa (job #3162216)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int mod = 123457;
int n, k, maxim = 0, sol;
struct nr{
int val, cnt;
nr(int x){
val = x;
cnt = 1;
}
};
vector<nr> h[123457];
void add(int x){
int e = x%mod;
for(int i=0; i<h[e].size(); i++){
if(h[e][i].val == x){
h[e][i].cnt++;
if(h[e][i].cnt > maxim){
maxim = h[e][i].cnt;
sol = x;
}
return;
}
}
h[e].push_back(nr(x));
}
int main(){
fin>>n;
for(int i=1; i<=n; i++){
fin>>k;
add(k);
}
if(maxim >= n/2+1) fout<<sol<<" "<<maxim;
else fout<<-1;
}