Pagini recente » Cod sursa (job #360136) | Cod sursa (job #2157848) | Rating Nimei Altul (ElViolatore) | Cod sursa (job #445812) | Cod sursa (job #2745089)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int a[1000001];
int main()
{
int n, nr, maxi;
cin >> n;
for(int i = 1; i <= n; ++i)
cin >> a[i];
sort(a + 1, a + n + 1);
bool ok = false;
int cnt = 1;
for(int i = 2; i <= n; ++i){
if(a[i] == a[i - 1])
cnt++;
if(cnt >= ((n / 2) + 1))
ok = true, nr = a[i - 1], maxi = cnt;
if(a[i] != a[i - 1])
cnt = 1;
}
if(ok)
cout << nr << ' ' << maxi;
else
cout << -1;
return 0;
}