Cod sursa(job #1992585)
Utilizator | Data | 20 iunie 2017 21:01:59 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
using namespace std;
int main()
{
int i,n,aux,maj=0,count=0, pairs = 0;
cin>>n;
for (i = 0; i <n;i++)
{
cin>>aux;
if (aux!= maj)
count --;
else
{
count ++; pairs++;
}
if (count < 0 )
{
count = 1; pairs++;
maj = aux;
}
cout<<maj<<' '<<count<<'\n';
}
cout<<maj<<' '<<pairs<<'\n';
return 0;
}