Pagini recente » Cod sursa (job #2257010) | Cod sursa (job #58523) | Cod sursa (job #230790) | Cod sursa (job #729) | Cod sursa (job #2519338)
#include <fstream>
#include<algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,i,v[1000005],l,elmaj;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
elmaj=v[1];
l=1;
for(i=2; i<=n; i++)
{
if(v[i]==elmaj)
l++;
else
{
l--;
if(l<0)
{
elmaj=v[i];
l=1;
}
}
}
l=0;
for(i=1;i<=n;i++)
{
if(v[i]==elmaj)
l++;
}
if(l>=n/2+1)
fout<<elmaj<<" "<<l;
else
fout<<-1;
return 0;
}