Cod sursa(job #2179425)
Utilizator | Data | 20 martie 2018 11:04:31 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,v[1000002],cand,k;
int main()
{
int i;
f>>n;
for(i=1;i<=n;i++) f>>v[i];
cand=-1; k=0;
for(i=1;i<=n;i++)
{
if(k==0) {cand=v[i];k=1;}
else if(cand==v[i]) k++;
else k--;
}
if(cand==-1) g<<-1<<'\n';
else
{
int nr=0;
for(i=1;i<=n;i++)
if(v[i]==cand) nr++;
g<<cand<<' '<<nr<<'\n';
}
f.close();
g.close();
return 0;
}