Pagini recente » Cod sursa (job #2975389) | Cod sursa (job #2909679) | Cod sursa (job #2396470) | Cod sursa (job #2502054) | Cod sursa (job #2195935)
#include <fstream>
#define N 1000001
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
long long x[N];
int main()
{
int n,i,nrap,candidat,j;
cin >> n;
for(i=1; i<=n; i++)
{
cin >> x[i];
}
candidat=x[1];
nrap=1;
for(j=2; j<=n; j++)
if(x[j]==candidat)
nrap++;
else if(nrap>0)
nrap--;
else
{
nrap=1;
candidat=x[j];
}
if(nrap>0)
{
nrap=0;
for(j=1; j<=n; j++)
if(x[j]==candidat)
nrap++;
}
if(nrap>n/2)
{
cout << candidat << " " << nrap;
}
return 0;
}