Pagini recente » Cod sursa (job #2207768) | Cod sursa (job #2731714) | Cod sursa (job #658979) | Cod sursa (job #245569) | Cod sursa (job #1791129)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
int a[1001],i,j,nr,n,x,y,p,lmax,lc,c,nr1;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
nr=1;
c=a[1];
for(i=2; i<=n; i++)
{
if(a[i]==c)
nr++;
else
nr--;
if(nr<0)
{
c=a[i];
nr=1;
}
}
for(i=1; i<=n; i++)
if(c==a[i]) nr1++;
if(nr1>=n/2) g<<c<<" ";
return 0;
}