Pagini recente » Cod sursa (job #1164460) | Cod sursa (job #2704524) | Cod sursa (job #1310673) | Cod sursa (job #355060) | Cod sursa (job #2053634)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
#define lim 1000010
int n, ini[lim], ultim, c, rez;
int main()
{
fin>>n;
for (int i=1; i<=n; i++)
fin>>ini[i];
sort (ini+1, ini+n+1);
ultim = ini[1];
c=1;
for (int i=2; i<=n; i++)
{
if (ini[i] == ultim) c++;
else c--;
if (c<0)
{
ultim = ini[i];
c=0;
}
}
for (int i=1; i<=n; i++)
if (ultim==ini[i]) rez++;
cout<<ultim<<rez;
if (rez>=n/2)
fout<<ultim<<' '<<rez;
else fout<<-1;
fin.close();
fout.close();
return 0;
}