Cod sursa(job #3239509)
| Utilizator | Data | 6 august 2024 08:16:21 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,i,v[1000005],nr;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
sort(v+1,v+n+1);
nr=1;
for(i=2; i<=n; i++)
{
if(v[i]==v[i-1])
nr++;
else
{
if(nr==n/2+1)
{
fout<<v[i-1]<<" "<<n/2+1;
return 0;
}
nr=1;
}
}
if(nr==n/2+1)
{
fout<<nr<<" "<<n/2+1;
return 0;
}
fout<<-1;
return 0;
}
