Cod sursa(job #1993386)
Utilizator | Postu Alexandru Humiko | Data | 22 iunie 2017 20:09:55 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int v[1000001];
int main()
{
int pretendent, n, majoritar, k=0;
fin>>n;
for (int i=1;i<=n;++i)
fin>>v[i];
pretendent=v[1];
majoritar=1;
for (int i=2;i<=n;++i)
{
if (pretendent==v[i])
majoritar++;
else
{
majoritar--;
if (!majoritar)
{
pretendent=v[i];
majoritar++;
}
}
}
for (int i=1;i<=n;++i)
if (v[i]==pretendent)
k++;
fout<<pretendent<<" "<<k;
}