Cod sursa(job #697678)
Utilizator | Neagu Gabriel wizekid | Data | 29 februarie 2012 10:30:32 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
#define nmaxim 1000001
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,v[nmaxim],maxim,k,nr;
int main()
{f>>n;
int k=0;
for(int i=1;i<=n;i++) f>>v[i];
for(int i=1;i<=n;i++)
{if(k==0)
{k=1;
maxim=v[i];
}
else if(maxim==v[i]) k++;
else k--;
}
int nr=0;
for(int i=1;i<=n;i++) if(v[i]==maxim) nr++;
g<<maxim<<" "<<nr<<'\n';
return 0;
}