Pagini recente » Cod sursa (job #2628758) | Cod sursa (job #1902165) | Cod sursa (job #3167899) | Cod sursa (job #1913128) | Cod sursa (job #1833161)
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int NMax = 1000000;
int N,Candidat,Nr,NrSol;
int A[NMax + 5];
int main()
{
fin >> N;
for(int i = 1; i <= N; ++i)
fin >> A[i];
Candidat = -1;
for(int i = 1; i <= N; ++i)
if(Nr == 0)
{
Candidat = A[i];
Nr = 1;
}
else
if(Candidat == A[i])
Nr++;
else
Nr--;
for(int i = 1; i <= N; ++i)
if(A[i] == Candidat)
NrSol++;
if(NrSol >= N/2 + 1)
fout << Candidat << " " << NrSol << "\n";
else
fout << "-1\n";
return 0;
}