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