Pagini recente » Cod sursa (job #2363917) | Cod sursa (job #2108390) | Cod sursa (job #2134049) | Cod sursa (job #1048439) | Cod sursa (job #2133971)
#include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long arr[n+5] = {0};
long freq[n+5] = {0};
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
freq[arr[i]]++;
// sort(freq, freq+n);
int ind, max;
max = freq[arr[0]];
ind = arr[0];
for (int i = 1; i < n; i++)
if (max < freq[i])
{
max = freq[i];
ind = i;
}
if (freq[ind] >= (n/2+1))
cout << ind << " " << freq[ind];
else
cout << -1;
return 0;
}