Pagini recente » Cod sursa (job #786443) | Borderou de evaluare (job #540819) | Statistici SapientiaBalaSuketSzakacs (SapientiaBalaSuketSzakacs) | Istoria paginii problema/light2 | Cod sursa (job #896729)
Cod sursa(job #896729)
#include <cstdio>
using namespace std;
int n,x[1000001];
void citire()
{
freopen("elmaj.in","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&x[i]);
}
int solve()
{
int elem,nr=-1;
for(int i=1;i<=n;++i)
{
if(nr<0)
{
elem=x[i];
nr=1;
}
if(elem!=x[i])
nr--;
else
++nr;
}
if(nr<0)
elem=-1;
return elem;
}
int main()
{
citire();
int elem=solve();
freopen("elmaj.out","w",stdout);
printf("%d ",elem);
int nr_apar=0;
if(elem>-1){
for(int i=1;i<=n;++i)
if(x[i]==elem)
nr_apar++;
printf("%d ",nr_apar);}
return 0;
}