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