Pagini recente » Istoria paginii runda/simci/clasament | Cod sursa (job #2074864) | Cod sursa (job #2587898) | Cod sursa (job #2068678) | Cod sursa (job #2703931)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n,maxi,b,i,ok,a;
vector <int> x;
vector <int> ::iterator p,t;
int main()
{
cin>>n;
for(i=1;i<=n;++i)
{
cin>>a;
x.push_back(a);
}
sort(x.begin(),x.end());
a=x[n/2];
p=lower_bound(x.begin(),x.end(),a);
//cout<<p-x.begin();
t=upper_bound(x.begin(),x.end(),a);
//cout<<t-x.begin()-1;
if(t-p>=n/2+1)cout<<a<<" "<<t-p;
else cout<<"-1";
/*cin>>n;
maxi=-1;
b=n/2+1;
for(i=1;i<=n;++i)
{
cin>>a;
++x[a];
maxi=max(a,maxi);
}
for(i=1;i<=maxi;++i)
{
if(x[i]>=b)
{
cout<<i<<" "<<x[i]<<"\n";
ok=1;
break;
}
}
if(ok==0)cout<<"-1";*/
return 0;
}