Pagini recente » Cod sursa (job #2084346) | Cod sursa (job #569538) | Cod sursa (job #2376821) | Cod sursa (job #917133) | Cod sursa (job #2164134)
#include <bits/stdc++.h>
using namespace std;
ofstream fout("elmaj.out");
const int Nmax = 1000002;
int N;
int a[Nmax];
void Read()
{
ifstream fin("elmaj.in");
int i;
fin >> N;
for (i = 1; i <= N; i++)
fin >> a[i];
fin.close();
}
void Solve()
{
int nrvot,i;
int ales, x;
ales = a[1];
nrvot = 1;
for (i = 2; i <= N; i++)
{
x = a[i];
if(x == ales)
nrvot++;
else
nrvot--;
if(nrvot == 0)
{
ales = x;
nrvot = 1;
}
}
nrvot = 0;
for (i = 1; i <= N; i++)
if (ales == a[i])
nrvot++;
ofstream fout("elmaj.out");
if(nrvot > N / 2)
fout << ales << " " << nrvot << "\n";
else fout << "-1\n";
fout.close();
}
int main()
{
Read();
Solve();
return 0;
}