Pagini recente » Cod sursa (job #2939033) | Cod sursa (job #1088901) | Cod sursa (job #1278655) | Cod sursa (job #3135570) | Cod sursa (job #1047786)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n, a[1000001];
int main ()
{
in >> n;
for (int i = 1; i <= n; i ++)
in >> a[i];
int aparitii = 0, nr;
for (int i = 1; i <= n; i ++)
if (!aparitii)
{
nr = a[i];
aparitii = 1;
}
else
if (a[i] == nr)
aparitii ++;
else
aparitii --;
aparitii = 0;
for (int i = 1; i <= n; i ++)
if (a[i] == nr)
aparitii ++;
if (aparitii >= n / 2 + 1)
out << nr << " " << aparitii;
else
out << -1;
in.close();
out.close();
return 0;
}