Pagini recente » simulareoji_2006_11-12 | Cod sursa (job #1909521) | Cod sursa (job #83863) | Istoria paginii runda/pregatire_oji/clasament | Cod sursa (job #2277856)
#include <bits/stdc++.h>
#define DIM 100005
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
map<long long, int> f;
int v[DIM];
int n, x, maxi, x_max;
int main()
{
in>>n;
for( int i = 1; i <= n; i++ )
{
in>>v[i];
f[v[i]]++;
}
maxi = -1;
x_max = -1;
for( int i = 1; i <= n; i++ )
if( maxi < f[v[i]] )
{
maxi = f[v[i]];
x_max = v[i];
}
if( maxi >= n/2 + 1 )
out<<x_max<<" "<<maxi;
else
out<<-1;
return 0;
}