Cod sursa(job #2645214)
| Utilizator | Data | 27 august 2020 15:20:04 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
int main()
{
int n, k;
int maxAp = 0;
int elMax ;
map<int,int> mp;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
in >> n;
for(int i = 0 ; i < n ; i++)
{ in >> k;
if (mp[k] == NULL) {
mp[k] = 1;
} else {
mp[k]++;
}
if(mp[k] > maxAp)
{
maxAp = mp[k];
elMax = k;
}
}
if(maxAp >= n/2 + 1)
{
out<<elMax<<" "<<maxAp;
}
else out << -1;
return 0;
}
