Pagini recente » Cod sursa (job #178595) | Cod sursa (job #1693282) | Cod sursa (job #350788) | Cod sursa (job #925889) | Cod sursa (job #649174)
Cod sursa(job #649174)
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int v[1000001];
int main ()
{
int n,i,x,nr;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f.close();
nth_element(v+1,v+((1+n)/2),v+n+1);
x=v[(1+n)/2];
nr=0;
for(i=1;i<=n;i++)
if(v[i]==x)
nr++;
if(nr>=1+n/2)
g<<x<<" "<<nr;
else g<<"-1";
g.close();
return 0;
}