Cod sursa(job #2850502)
Utilizator | Data | 16 februarie 2022 21:08:34 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,v[1000001],l=1,lmax=1,nr=-1;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
sort(v+1,v+n+1);
for(int i=1;i<=n;i++)
{
if(v[i]==v[i-1])
{
l++;
if(l>lmax)
{
lmax=l;
nr=v[i];
}
}
else
{
l=1;
}
}
if(lmax>n/2)
fout<<nr<<" "<<lmax;
else
{
fout<<-1;
}
}