Cod sursa(job #1414171)
| Utilizator | Data | 2 aprilie 2015 13:39:13 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <algorithm>
#include <iomanip>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int N, x, ap=1, sol, a[1000005], prec;
int main()
{
f>>N;
for (int i=1; i<=N; ++i)
{
f>>a[i];
if (ap==0) prec=a[i], ap=1;
else if (a[i]==prec) ++ap;
else --ap;
}
if (ap>0)
{
ap=0;
for (int i=1; i<=N; ++i)
if (a[i]==prec) ++ap;
g<<prec<<' '<<ap<<'\n';
}
else g<<-1<<'\n';
return 0;
}
