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