Pagini recente » Cod sursa (job #2413656) | Cod sursa (job #2593147) | Cod sursa (job #1859189) | Cod sursa (job #1186289) | Cod sursa (job #3285370)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, t,start,p1,p2,i,j,v[6000001],s,smax=-2000000000,Cand,k,ap;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
}
Cand=v[1];
ap=1;
for(i=2;i<=n;i++)
{
if(v[i]==Cand)
{
ap++;
}
else
{
ap--;
}
if(ap<0)
{
Cand=v[i];
ap=i;
}
}
k=0;
for(i=1;i<=n;i++)
{
if(v[i]==Cand)
{
k++;
}
}
if(k>n/2)
{
fout<<Cand<<" "<<k;
}
return 0;
}