Pagini recente » Cod sursa (job #2073116) | Cod sursa (job #726366) | Statisticile problemei Curatenie | Cod sursa (job #2263946) | Cod sursa (job #1519170)
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
long n,v[1000001],x,i,k;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
x=v[1];k=1;
for(i=2;i<=n;i++)
if(x==v[i])k++;
else if(k>0)k--;
else
{
x=v[i];
k=1;
}
k=0;
for(i=1;i<=n;i++)
if(x==v[i])k++;
if(k>n/2)fout<<x<<" "<<k;
else fout<<"-1";
return 0;
}