Pagini recente » Cod sursa (job #637660) | Cod sursa (job #191629) | Cod sursa (job #3277044) | Cod sursa (job #1954747) | Cod sursa (job #759086)
Cod sursa(job #759086)
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n, a[1000000];
int main()
{
in >> n;
int k = 0;
int candidat = -1;
for (int i = 0; i < n; i++)
{
in >> a[i];
if (!k)
{
k++;
candidat = a[i];
}
else if (candidat == a[i])
k++;
else k--;
}
k = 0;
for (int i = 0; i < n; i++)
if (a[i] == candidat)
k++;
if (k > n / 2)
out << cand << " " << k;
else out << -1;
return 0;
}