Cod sursa(job #2478193)
| Utilizator | Data | 21 octombrie 2019 19:04:58 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int a[1000001],n,maj,cnt;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
for(int i=1;i<=n;i++)
{
if(cnt==0)
{
maj=a[i];
cnt=1;
}
else
if(a[i]==maj)
cnt++;
else
cnt--;
}
cnt=0;
for(int i=1;i<=n;i++)
if(a[i]==maj)
cnt++;
if(cnt>n-cnt)
g<<maj<<' '<<cnt;
else
g<<"-1";
return 0;
}
