Cod sursa(job #1791136)
| Utilizator | Data | 29 octombrie 2016 09:50:17 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
int a[1000002],i,j,nr,n,x,y,p,lmax,lc,c,nr1;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
nr=1;
c=a[1];
for(i=2; i<=n; i++)
{
if(a[i]==c)
nr++;
else
nr--;
if(nr<0)
{
c=a[i];
nr=1;
}
}
for(i=1; i<=n; i++)
if(c==a[i]) nr1++;
if(nr1>=n/2) g<<c<<" "<<nr1;
return 0;
}
