Pagini recente » Cod sursa (job #1118501) | Cod sursa (job #2408862) | Cod sursa (job #1316123) | Cod sursa (job #1316900) | Cod sursa (job #1047011)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int a[1000020],n,i;
int main()
{
int x,k;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
x=a[1];
k=1;
for(i=2;i<=n;i++)
{
if(k==0)
{
x=a[i];
k=1;
}
else
{
if(a[i]==x)
k++;
else
k--;
}
}
k=0;
for(i=1;i<=n;i++)
if(a[i]==x)
k++;
if(k>=n/2+1)
g<<x<<" "<<k;
else
g<<'1';
f.close();
g.close();
return 0;
}