Pagini recente » Cod sursa (job #3168807) | Cod sursa (job #2512346) | Cod sursa (job #2246020) | Cod sursa (job #2565970) | Cod sursa (job #1595600)
#include <fstream>
using namespace std;
int v[1000005],n;
int main()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int candidat,major,i;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
candidat=v[1];
major=1;
for(i=2;i<=n;i++)
{
if(v[i]==candidat)major++;
else
major--;
if(major<0)
{
candidat=v[i];
major=1;
}
}
major=0;
for(i=1;i<=n;i++)
if(v[i]==candidat)major++;
if(major>n/2)fout<<candidat<<" "<<major<<" ";
else
fout<<"-1";
fin.close();
fout.close();
}