Pagini recente » Cod sursa (job #1345006) | Cod sursa (job #1368623) | Borderou de evaluare (job #2201576) | Cod sursa (job #3002407) | Cod sursa (job #1396922)
#include <fstream>
#include <algorithm>
using namespace std;
long v[1000001],n,c,i,k;
int main()
{ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
k=0;c=-1;
for(i=1;i<=n;i++)
{f>>v[i];
if(k==0){c=v[i];k=1;}
else if(c==v[i])k++;
else k--;
}
k=0;
for(i=1;i<=n;i++)
{if(c==v[i])k++;}
if(k>=(n/2+1))g<<c<<" "<<k;
else g<<"-1";
return 0;
}