Pagini recente » Cod sursa (job #2516959) | Cod sursa (job #2693626) | Borderou de evaluare (job #942007) | Cod sursa (job #3279671) | Cod sursa (job #3214811)
#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;
}