Pagini recente » Cod sursa (job #2970872) | Cod sursa (job #2047527) | Cod sursa (job #2107860) | Cod sursa (job #143770) | Cod sursa (job #1775624)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
#define lim 1000001
int n,v[lim];
void rezolvare()
{
int k=0,aux=-1,i;
for(i=1; i<=n; i++)
{
if(k==0)
{
aux=v[i];
k=1;
}
else
if(v[i]==aux) k++;
else k--;
}
// if(aux<0)
// fout<<aux;
int nr=0;
for(i=1; i<=n; i++)
if(v[i]==aux)
nr++;
if(nr>n/2)
fout<<aux<<' '<<nr;
else
fout<<-1;
}
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
rezolvare();
fin.close();
fout.close();
return 0;
}