Pagini recente » Cod sursa (job #2419435) | Atasamentele paginii becreative23 | Cod sursa (job #2419441) | Cod sursa (job #1838946) | Cod sursa (job #2388628)
//#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
vector<long long>x;
int i,maxi,b,a,db,n;
int main()
{
cin>>n;
x.resize(n);
for(i=0;i<n;++i)
cin>>x[i];
sort(x.begin(),x.end());
a=(n/2)+1;
maxi=-999;
b=0;
for(i=0;i<n-1;++i)
{
if(x[i]==x[i+1]) db++;
else db=1;
if(db>=a && maxi<db)
{
b=x[i];
maxi=db;
}
}
if(b==0) cout<<"-1"<<" "<<"-1";
else cout<<b<<" "<<maxi;
return 0;
}