Cod sursa(job #1980269)
Utilizator | Data | 12 mai 2017 18:52:52 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long a[1000001],i,j,n,k,l,p;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
k=a[1];
l=1;
for(i=2;i<=n;i++)
{
if(l==0)
{
k=a[i];
l=1;
}
else if(k=a[i]) l++;
else l--;
}
l=0;
for(i=1;i<=n;i++)
if(a[i]==k) l++;
g<<k<<" "<<l;
return 0;
f.close();
g.close();
}