Pagini recente » Cod sursa (job #397126) | Cod sursa (job #1134916) | Cod sursa (job #2506145) | Cod sursa (job #1678697) | Cod sursa (job #2450246)
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
void r(int &a)
{
int elsker;
scanf("%d",&elsker);
a=elsker;
}
const int N=(int)1e6+7;
int n;
int a[N];
int b[N];
void jeg(int num)
{
int votes=0;
for(int i=1;i<=n;i++)
votes+=(a[i]==num);
if(votes>=n/2+1)
cout<<num<<" "<<votes<<"\n";
else
cout<<"-1\n";
}
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
r(n);
for(int i=1;i<=n;i++)
{
r(a[i]);
b[i]=a[i];
}
nth_element(b+1,b+n/2,b+n+1);
jeg(b[n/2]);
return 0;
}