Pagini recente » Cod sursa (job #1529141) | Cod sursa (job #2552145) | Cod sursa (job #1446595) | Cod sursa (job #3133644) | Cod sursa (job #2719669)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
const int N = 1000000;
int candidat, n, nrap = 0;
int main()
{
in >> n >> v[0];
candidat = v[0];
nrap = 1;
for (int i = 1; i < n; i++)
{
in >> v[i];
if (v[i] == candidat)
{
nrap++;
}
else
{
nrap--;
}
if (nrap == 0)
{
candidat = v[i];
nrap = 1;
}
}
nrap = 0;
for (int i = 0; i < n; i++)
{
if (v[i] == candidat)
{
nrap++;
}
}
if (nrap > n/2)
{
out << candidat << " " << nrap;
}
else
{
out << -1;
}
return 0;
}