Cod sursa(job #662340)
Utilizator | Data | 16 ianuarie 2012 15:55:05 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long int n,v[1000005],i,t,k,u,m;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];k=1;t=v[1];
for(i=2;i<=n;i++)
if(v[i]==t)
k++;
else
{
if(k>0)
k--;
else
{k=1;t=v[i];}
}
k=0;
for(i=1;i<=n;i++)
{
if(v[i]==t)
k++;
}
if(k>=n/2+1)
g<<t<<" "<<k;
return 0;
}