Pagini recente » Cod sursa (job #2781586) | Cod sursa (job #3041086) | Cod sursa (job #1156065) | Cod sursa (job #803188) | Cod sursa (job #1500334)
#include <iostream>
#include <fstream>
int main()
{
std::ifstream fin("elmaj.in");
std::ofstream fout("elmaj.out");
int* seq;
int size;
fin >> size;
seq = new int[size];
fin >> seq[0];
int candidate = seq[0];
int occurences = 1;
for (int i = 1; i < size; i++)
{
fin >> seq[i];
if (seq[i] == candidate)
occurences++;
else
occurences--;
if (occurences == 0)
{
candidate = seq[i];
occurences = 1;
}
}
occurences = 0;
for (int i = 0; i < size; i++)
{
if (seq[i] == candidate)
occurences++;
}
if (occurences >= size / 2 + 1)
{
fout << candidate << " " << occurences;
}
else
{
fout << "-1";
}
delete seq;
fin.close();
fout.close();
return 0;
}