Cod sursa(job #2908701)
Utilizator | Data | 5 iunie 2022 10:36:34 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int a[1000001];
int main()
{
int n;
in>>n;
for(int i=0; i<n; i++)
in>>a[i];
int cand=-1;
int k=0;
for(int i=0; i<n; i++)
{
if(k==0)
{
cand=a[i];
k=1;
}
else if(a[i]==cand)
{
k++;
}
else
k--;
}
int nr=0;
for(int i=0; i<n; i++)
{
if(a[i]==cand)
nr++;
}
if(nr>n/2)
out<<cand<<" "<<nr;
else
out<<-1;
return 0;
}