Pagini recente » Cod sursa (job #1275001) | Cod sursa (job #1153602) | Rating Prioteasa Ioana (ioanaprioteasa15) | Cod sursa (job #1716284) | Cod sursa (job #1744461)
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int a[1000001];
int ver1 (int n, int &sum)
{
sort(a+1,a+n+1);
int maj=a[n/2];
for (int i=1;i<=n;++i)
{
if (maj==a[i])
++sum;
}
if (sum>=n/2+1)
return maj;
return -1;
}
int main ()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,sum=0;
fin>>n;
for (int i=1;i<=n;++i)
{
fin>>a[i];
}
fout<<ver1(n,sum)<<" ";
fout<<sum<<'\n';
return 0;
}