Pagini recente » Cod sursa (job #619087) | Cod sursa (job #1118869) | Cod sursa (job #2903789) | Cod sursa (job #618968) | Cod sursa (job #930046)
Cod sursa(job #930046)
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int i,j,n,v[1000001],nr=0;
int mooreMajority() {
int cand = -1, k = 0;
for (i = 1; i <= n; i++)
if (k == 0)
{
cand = v[i];
k = 1;
}
else
if (v[i] == cand)
k++;
else
k--;
if (cand < 0)
return cand;
for (int i = 1; i <= n; i++)
if (v[i] == cand)
nr++;
if (nr > n / 2)
return cand;
else
return -1;
}
int main()
{
fin>>n;
for(i=1;i<=n;++i)
fin>>v[i];
int rez=mooreMajority();
if(rez==-1)
fout<<rez;
else
fout<<rez<<" "<<nr;
return 0;
}