Cod sursa(job #3214811)
| Utilizator | Data | 14 martie 2024 14:39:32 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("input.in");
ofstream fout ("output.out");
unordered_map <int, int> mp;
int main()
{
int n, x;
cin>>n;
for (int i=1; i<=n; i++) {
cin>>x;
mp[x]++;
}
int element=-1;
for (auto it=mp.begin(); it!=mp.end(); it++) {
if (it->second>=n/2) {
element=it->first;
break;
}
}
if (element!=-1) cout<<"DA "<<element<<endl;
else cout<<"NU";
return 0;
}