Cod sursa(job #2547853)
| Utilizator | Data | 15 februarie 2020 19:29:49 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");
int v[1000001];
int main()
{
int n,k=0;
unsigned a;
fin>>n;
int maxim=-1,maxim2;
for (int i=0; i<n; i++)
{
fin>>a;
v[a]++;
}
for (int i=0; i<n; i++)
{
if (v[i]>maxim)
maxim=i;
}
for (int i=0; i<n; i++)
{
if (v[i]==v[maxim])
k++;
}
if (k==1)
fout<<maxim<<' '<<v[maxim];
else fout << -1;
return 0;
}
