Pagini recente » Cod sursa (job #1589425) | Cod sursa (job #2241326) | Cod sursa (job #1074854) | Diferente pentru problema/amlei intre reviziile 2 si 1 | Cod sursa (job #1646657)
#include <fstream>
#include <algorithm>
using namespace std;
int n,i,a[1000001],t,x;
int main()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
fin>>n;
for (i=1;i<=n;i++) fin>>a[i];
nth_element(a+1,a+n/2,a+n+1);
x=a[n/2];
for (i=1;i<=n;i++)
if (a[i]==x) ++t;
if (t>n/2) fout<<x<<" "<<t;
else fout<<"-1";
return 0;
}