Cod sursa(job #1214536)
Utilizator | Data | 30 iulie 2014 18:01:04 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fi("elmaj.in");
ofstream fo("elmaj.out");
const int nmax=1000005;
int s[nmax];
int main()
{
int n;
fi>>n;
int k=0,l=-1;
for (int i=1;i<=n;++i)
{
fi>>s[i];
if (!k)
++k,l=s[i];
else
if (l==s[i])
++k;
else
--k;
}
k=0;
for (int i=1;i<=n;++i)
if (s[i]==l)
++k;
if (k)
fo<<l<<" "<<k<<"\n";
else
fo<<"\n";
}