Pagini recente » Cod sursa (job #2143523) | Cod sursa (job #2966385) | Cod sursa (job #2457781) | Cod sursa (job #2761577) | Cod sursa (job #3239510)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,i,v[1000005],nr;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
sort(v+1,v+n+1);
nr=1;
for(i=2; i<=n; i++)
{
if(v[i]==v[i-1])
nr++;
else
{
if(nr>=n/2+1)
{
fout<<v[i-1]<<" "<<nr;
return 0;
}
nr=1;
}
}
if(nr==n/2+1)
{
fout<<nr<<" "<<n/2+1;
return 0;
}
fout<<-1;
return 0;
}