Pagini recente » Cod sursa (job #3316968) | Cod sursa (job #3355781) | Cod sursa (job #1094850) | Cod sursa (job #2768328) | Cod sursa (job #3312628)
#include<iostream>
#include<fstream>
#include <unordered_map>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int a[1000001];
int b[100005];
int main(){
unordered_map<int,int> freqMap;
int n;
bool k = false;
in >> n;
for (int i = 0; i < n; i++)
in >> a[i];
for (int i = 0; i < n; i++) {
freqMap[a[i]]++;
}
int MaxCount = 0;
int Majoritar = 0;
for(auto const [key, value] : freqMap){
if (value > MaxCount){
MaxCount = value;
Majoritar = key;
}
}
if(MaxCount > n/2 + 1)
out << Majoritar << " " << MaxCount;
else out << -1;
return 0;}