Pagini recente » Cod sursa (job #2371402) | Rating Raluca Vlad (raluvlad) | Cod sursa (job #679108) | Borderou de evaluare (job #1783313) | Cod sursa (job #1984334)
#include <iostream>
#include <fstream>
using namespace std;
const int nMax = 1000005;
int n;
int v[nMax];
void citire()
{
ifstream in("elmaj.in");
in >> n;
for(int i = 1; i <= n; ++i)
in >> v[i];
in.close();
}
void rezolvare()
{
ofstream out("elmaj.out");
int contor = 0, current;
for(int i = 1; i <= n; ++i)
{
if(contor == 0)
{
current = v[i];
contor = 1;
}
else
{
if(v[i] == current)
contor++;
else
contor--;
}
}
if(contor == 0)
{
out << -1;
return;
}
contor = 0;
for(int i = 1; i <= n; ++i)
if(v[i] == current)
contor++;
if(contor >= n/2+1)
out << current << " " << contor;
else
out << -1;
}
int main()
{
citire();
rezolvare();
return 0;
}