Pagini recente » Cod sursa (job #1136900) | Cod sursa (job #3161573) | Cod sursa (job #2404462) | Cod sursa (job #2366777) | Cod sursa (job #3139004)
#include <iostream>
#include <fstream>
using namespace std;
int n;
int v[1000002];
int main()
{
ifstream fin("elmaj.in");
fin >> n;
for(int i = 0; i < n; i++)
{
fin >> v[i];
}
fin.close();
int nr = -1;
int counter = 0;
for(int i = 0; i < n; i++)
{
if (v[i] == nr)
{
counter ++;
}
else
{
counter --;
if (counter < 0)
{
counter = 1;
nr = v[i];
}
}
}
counter = 0;
for(int i = 0; i < n; i++)
{
if(v[i] == nr)
{
counter ++;
}
}
ofstream fout("elmaj.out");
if (counter < n / 2 + 1)
{
fout << -1;
}
else
{
fout << nr << " " << counter;
}
return 0;
}