Pagini recente » Cod sursa (job #1203146) | Cod sursa (job #1985109) | Cod sursa (job #1671287) | Cod sursa (job #2494013) | Cod sursa (job #1615758)
#include <fstream>
#include <math.h>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
//#include <unordered_map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#include <map>
#define MAX 500000000000
//#include <iostream>
using namespace std;
//ifstream cin("jocul.in");
//ofstream cout("jocul.out");
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
map<long long, long long> z;
int main()
{
int n, ap = 0, num, a;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> a;
z[a]++;
if(z[a] > ap)
{
ap = z[a];
num = a;
}
}
if(ap >= n / 2 + 1)
cout << a << " " << ap;
else
cout << "-1";
return 0;
}