Pagini recente » Cod sursa (job #2692969) | HLO 2023 - Cls 11-12 - Tema 0 | Cod sursa (job #884096) | Cod sursa (job #1865040) | Cod sursa (job #1775843)
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int NMax = 1000005;
int N,X[NMax];
void Read()
{
fin>>N;
for(int i = 1; i <= N; ++i)
fin>>X[i];
}
void SolveandPrint()
{
int Candidat,Nr = 0;
for(int i = 1 ; i <= N; ++i)
{
if(Nr == 0)
{
Candidat = X[i];
Nr = 1;
}
else
if(X[i] == Candidat)
{
Nr++;
}
else
{
Nr--;
}
}
Nr = 0;
for(int i = 1 ; i <= N; ++i)
if(X[i]==Candidat)
Nr++;
if(Nr > N/2)
fout<<Candidat<<" "<<Nr<<"\n";
else
fout<<"-1\n";
}
int main()
{
Read();
SolveandPrint();
return 0;
}