Pagini recente » Cod sursa (job #2536716) | Cod sursa (job #1880004) | Cod sursa (job #2756210) | Cod sursa (job #1708230) | Cod sursa (job #1429228)
#include<fstream>
#include<algorithm>
using namespace std;
int n,v[1000005],s,mx,sol;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for(int i=1;i<=n;i++)f>>v[i];
sort(v+1,v+n+1);s=1;
for(int j=2;j<=n;j++)
if(v[j]==v[j-1])s++;
else
{
if(s>=n/2+1&&s>mx){mx=s;sol=v[j-1];}
s=1;
}
if(s>=n/2+1&&s>mx){mx=s;sol=v[n];}
if(mx!=0)g<<sol<<" "<<mx;
else g<<"-1";
return 0;
}