Pagini recente » Cod sursa (job #328535) | Cod sursa (job #2703046) | Cod sursa (job #365736) | Cod sursa (job #1469543) | Cod sursa (job #661657)
Cod sursa(job #661657)
#include<fstream>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
unsigned long long n, a[1000001],b[1000001], majoritar, sol, i;
bool adevarat;
int main()
{
long long max=0;
cin>>n;
for(i=1;i<=n;i++)
{ cin>>a[i];
b[a[i]]++;
if(a[i]>max)
max=a[i];
}
// majoritar=n/2+1;
for(i=1;i<=max;i++)
if(b[i]>=majoritar)
{sol=b[i];
majoritar=i;}
if (sol>=n/2+1) cout<<majoritar<<" "<<sol;
else cout<<"-1";
return 0;
}