Cod sursa(job #2421331)
| Utilizator | Data | 14 mai 2019 19:09:23 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long int v[1000005];
int main()
{
int i, maj, n, cnt=0, x;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
x = v[1];
for(i=1;i<=n;i++)
{
if(v[i]==x)
cnt++;
else
cnt--;
if(cnt<0)
{
x=v[i];
cnt=1;
}
}
maj=(n/2)+1; cnt=0;
for(i=1;i<=n;i++)
{
if(x==v[i])
cnt++;
}
if(cnt>=maj)
g<<x<<" "<<cnt;
return 0;
}
