Cod sursa(job #3225014)
Utilizator | Floroiu Marius Cristian Floroiu_Marius | Data | 16 aprilie 2024 19:50:37 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,v[1000003],cand,k=1,ap;
int main()
{
fin>>n;
for (int i=1;i<=n;i++)
fin>>v[i];
cand=v[1];
for (int i=2;i<=n;i++)
{
if (v[i]==cand) k++;
else k--;
if (k<=0)
cand=v[i];
}
for (int i=1;i<=n;i++)
if (v[i]==cand) ap++;
if (ap>n/2)
fout<<cand<<" "<<ap;
else
fout<<"-1";
return 0;
}