Pagini recente » Cod sursa (job #2129468) | Cod sursa (job #1823706) | Cod sursa (job #2342168) | Cod sursa (job #1488517) | Cod sursa (job #2516051)
#include<bits/stdc++.h>
#define all(s) s.begin(),s.end()
#define rc(x) return cout<<x<<endl,0
#define forn(i,n) for(int i=0;i<int(n);i++)
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const int nmax=2e5+3;
const int mod=2011;
const ll inf=0x3f3f3f3f3f3f3f3f;
using namespace std;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
int n;
cin>>n;
vector<int>v;
forn(i,n)
{
int x;
cin>>x;
v.pb(x);
}
sort(all(v));
int k=1;
for(int i=1;i<n;i++)
{
if(v[i]==v[i-1]) k++; else
{
if(k>n/2) return cout<<v[i-1]<<" "<<k, 0;
k=1;
}
}
if(k>n/2) return cout<<v[n-1]<<" "<<k,0;
cout<<"-1\n";
}