Pagini recente » Cod sursa (job #82495) | Cod sursa (job #1977540) | Profil M@2Te4i | Profil M@2Te4i | Cod sursa (job #2133984)
#include <bits/stdc++.h>
using namespace std;
int main() {
ifstream inf ("elmaj.in");
ofstream outf ("elmaj.out");
long n;
inf >> n;
long arr[1000005] = {0};
long freq[1000005] = {0};
for (long i = 0; i < n; i++)
inf >> arr[i];
for (long i = 0; i < n; i++)
freq[arr[i]]++;
// sort(freq, freq+n);
long ind = 0;;
for (long i = 1; i < n; i++)
if (freq[ind] < freq[i])
ind = i;
if (freq[ind] >= (n/2+1))
outf << ind << " " << freq[ind];
else
outf << -1;
return 0;
}