Pagini recente » Cod sursa (job #652362) | Cod sursa (job #2178257) | Cod sursa (job #228376) | Cod sursa (job #656788) | Cod sursa (job #2785080)
#include <fstream>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
/*
int n, apar, val[1000001], candidat;
int main()
{
cin>>n;
for(int k=1;k<=n;k++)
{
cin>>val[k];
if(apar==0)
{
apar++;
candidat=val[k];
}
else if(candidat!=val[k])
apar--;
else
apar++;
}
apar = 0;
for(int i = 1; i <=n; i++)
if(val[i] == candidat)
apar++;
if(apar >= n/2 + 1)
cout<<candidat<<' '<<apar;
else
cout<<-1;
return 0;
}
#include <iostream>
#include <map>
using namespace std;
*/
int n, x;
map <int, int> mp;
int main()
{
cin>>n;
int nr = -1;
while(cin>>x){
mp[x]++;
if(mp[x] >= n/2 + 1)
nr = x;
}
if(nr == -1)
cout<<-1;
else
cout<<nr<<' '<<mp[nr]<<'\n';
return 0;
}