Cod sursa(job #3274575)
| Utilizator | Data | 7 februarie 2025 10:29:26 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 10 |
| 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 a[1000005],n;
int main()
{
int i,cnt=1,cntmax=0,nr;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
sort(a+1,a+n+1);
for(i=2;i<=n;i++)
{
if(a[i]==a[i-1])
cnt++;
else if(cnt>=cntmax)
{
cntmax=cnt;
nr=a[i-1];
}
}
if(cntmax>=n/2+1)
fout<<nr<<" "<<cntmax;
else fout<<-1;
return 0;
}
