Pagini recente » Cod sursa (job #2340180) | Cod sursa (job #2382541) | Cod sursa (job #3125920) | Cod sursa (job #106711) | Cod sursa (job #2129686)
#include <bits/stdc++.h>
using namespace std;
int a[1000005],n;
int main()
{
ifstream in("elmaj.in");
ofstream out("elmaj.out");
in >> n;
for (int i=1; i<=n; i++) in >> a[i];
sort( a+1, a+n+1);
int check = 1, ans = 0, el;
for( int i=1; i <n; i++)
{
if( a[i] == a[i+1] ) check ++;
else if( check > ans ) el = a[i], ans = check ,check =1;
else check = 1;
}
if( check > ans ) ans = check, el = a[n];
if( ans >= n /2 + 1) out << el << ' ' << ans ; else out << -1;
return 0;
}