Pagini recente » Cod sursa (job #258034) | onis-2016/solutii-runda-1 | Cod sursa (job #777813) | Cod sursa (job #2035014) | Cod sursa (job #2336073)
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int v[1000001];
int main()
{
int n, cand = -1, k = 0;
in >> n;
for (int i = 1; i <= n; ++i)
{
in >> v[i];
if (k == 0)
{
cand = v[i];
k = 1;
}
else if (v[i] == cand)
++k;
else
--k;
}
int nr = 0;
for (int i = 1; i <= n; ++i)
{
if (v[i] == cand)
++nr;
}
if (nr >= n / 2 + 1)
out << cand << " " << nr;
else
out << -1;
return 0;
}