Pagini recente » Cod sursa (job #1478577) | Cod sursa (job #650322) | Cod sursa (job #2705152) | Cod sursa (job #598253) | Cod sursa (job #1750089)
//#include "stdafx.h"
#include <iostream>
#include <fstream>
using namespace std;
int elements[1000001];
int main()
{
int n;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
in >> n;
for (int i = 0; i <= n - 1; i++)
in >> elements[i];
int element = -1, counter = 0;
for (int i = 0; i <= n - 1; i++)
{
if (counter == 0)
{
element = elements[i];
counter = 1;
}
else if (element == elements[i])
counter++;
else
counter--;
}
//verification
if (counter > 0)
{
int criteria = n / 2, count = 0;
for (int i = 0; i <= n - 1; i++)
{
if (element == elements[i])
{
count++;
if (count > criteria)
{
out << element << " " << count;
break;
}
}
}
}
else out << -1;
return 0;
}