Pagini recente » Cod sursa (job #438180) | Cod sursa (job #763223) | Cod sursa (job #599253) | Cod sursa (job #309752) | Cod sursa (job #2132432)
#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 j,c=1;
for(int i=0;i<n-1;i++)
{
j=i+1;
if(v[i]==v[j])
c++;
else
{
if(c>n/2)
{
fout<<v[i]<<" "<<c;return 0;
}
c=1;
}
}
fout<<"-1";
return 0;
}