Pagini recente » Cod sursa (job #3255183) | Cod sursa (job #1593913) | Cod sursa (job #942971) | Cod sursa (job #1664967) | Cod sursa (job #3130423)
#include <bits/stdc++.h>
#define N 1000000
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, a[N + 5];
void Citire()
{
fin >> n;
for(int i = 1; i <= n; ++i)
fin >> a[i];
}
void Rezolvare()
{
int cand = a[1], vot = 1;
for(int i = 2; i <= n; ++i)
if(a[i] == cand) vot++;
else
{
if(vot == 0) cand = a[i], vot = 1;
else vot--;
}
/// el a iesit invingator, dar are majoritatea?
vot = 0;
for(int i = 1; i <= n; ++i)
if(a[i] == cand) vot++;
if(vot >= n / 2 + 1) fout << cand << " " << vot;
else fout << -1;
}
int main()
{
Citire();
Rezolvare();
return 0;
}