Cod sursa(job #3184398)
| Utilizator | Data | 15 decembrie 2023 19:24:08 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("elmaj.in");
ofstream out ("elmaj.out");
const int NMAX=1000005;
int n,cnt,maj;
int v[NMAX];
int main()
{
in>>n;
for(int i=1; i<=n; i++)
{
in>>v[i];
if(maj!=v[i])
{
if(cnt==0)
maj=v[i],cnt++;
else
cnt--;
}
else if(maj==v[i])
cnt++;
}
cnt=0;
for(int i=1; i<=n; i++)
if(v[i]==maj)
cnt++;
if(cnt>=(n/2)+1)
out<<maj<<" "<<cnt;
else
out<<-1;
return 0;
}
