Pagini recente » Cod sursa (job #2230107) | Cod sursa (job #272946) | Cod sursa (job #1195124) | Cod sursa (job #1966271) | Cod sursa (job #1490364)
#include <iostream>
#include <fstream>
#include <map>
#include <vector>
using namespace std;
int n;
map<int,int> m;
vector<int> v;
int el=-1;
int k;
void read()
{
scanf("%d ",&n);
int x;
for(int i=0;i<n;i++)
{
scanf("%d ",&x);
m[x]++;
if(k==0)
el=x,k=1;
else if(el==x) k++;
else k--;
}
}
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
read();
if(el!=-1)
if(m[el]>n/2)
printf("%d %d",el,m[el]);
else printf("-1");
return 0;
}