Pagini recente » Cod sursa (job #48486) | Cod sursa (job #2384471) | Cod sursa (job #243285) | Cod sursa (job #1948020) | Cod sursa (job #2956260)
#include <bits/stdc++.h>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n,v[1000001],nr=1,ma=-1,ma1=-1,cnt=1,a,b;
int main()
{
in>>n;
for(int i=1; i<=n; i++)
in>>v[i];
sort(v+1,v+n+1);
/*int j=n/2;
if(v[j]==v[j+1])
while(v[j]==v[j+1])
j++;*/
for(int i=1; i<n; i++)
{
if(v[i]==v[i+1])
nr++;
else
{
if(ma<nr)
ma=nr,a=v[i];
nr=1;
}
/* if(j<n-1)
{
j++;
if(v[j]==v[j+1])
cnt++;
else
{
if(ma1<cnt)
ma1=cnt,b=v[j];
cnt=1;
}
}*/
}
if(ma>=n/2+1)
out<<a<<" "<<ma;
else
out<<-1;
return 0;
}