Pagini recente » Cod sursa (job #1974294) | Cod sursa (job #1489896) | Cod sursa (job #2529803) | Cod sursa (job #2530553) | Cod sursa (job #916602)
Cod sursa(job #916602)
#include <cstdio>
#include <algorithm>
#define nMax 100100
using namespace std;
int a[nMax];
int n;
int ap;
int main()
{
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
scanf("%d", &n);
for(int i = 0; i < n; ++ i){
scanf("%d", &a[i]);
}
sort(a, a + n);
ap = 1;
for(int i = 1; i <= n; ++ i){
if(a[i - 1] == a[i]){
ap ++;
}else{
if(ap >= n / 2 + 1){
printf("%d %d\n", a[i - 1], ap);
return 0;
}
ap = 1;
}
}
printf("-1\n");
return 0;
}