Pagini recente » Cod sursa (job #1527250) | Cod sursa (job #1111389) | Statistici heutschi vlad (heutschivlad) | Cod sursa (job #1592752) | Cod sursa (job #1331159)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int a[1000000];
int main()
{ int n,i,fr,c;
f>>n;
for (i=0;i<n;i++)
f>>a[i];
for (i=0;i<n;i++)
{ fr=1;
if (a[i]==a[i+1])
{
fr++;
c=a[i];
}
else
fr--;
}
for (i=0;i<n;i++)
{
if (a[i]==c)
fr++;
}
if (fr>0)
{ fr=1;
for (i=0;i<n;i++)
{
if (c==a[i])
fr++;
}}
if (fr>n/2+1)
g<<c<<" "<<fr;
else g<<-1;
return 0;
}