Pagini recente » Cod sursa (job #3211482) | Cod sursa (job #45148) | Cod sursa (job #2628247) | Cod sursa (job #811619) | Cod sursa (job #2132598)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
long long v[1000000];
int n;
fin>>n;
for(int i=0;i<n;i++)
fin>>v[i];
sort(v,v+n);
int mj=v[0],c=1;
v[n]=0;
for(int i=1;i<=n;i++)
{
if(v[i]==mj)
c++;
else
{
if(c>n/2)
{
fout<<mj<<" "<<c;return 0;
}
c=1;
mj=v[i];
}
}
fout<<"-1";
return 0;
}