Cod sursa(job #1331099)
| Utilizator | Data | 31 ianuarie 2015 12:30:24 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[105];
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, i, numar, fr=1, verif=0;
f>>n;
for(i=1;i<=n;++i)
f>>v[i];
for(i=2;i<=n;++i)
{ if (v[i]==v[i-1]) fr++;
else fr--;
if (fr==0) { numar=v[i]; fr=1; }
}
for (i=1;i<=n;++i)
{ if (v[i]==numar) verif++;
}
if (verif>n/2) g<<numar;
else g<<"-1";
return 0;
}
