(c++) SWEA "1204) 최빈수"

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=1&problemLevel=2&problemLevel=3&contestProbId=AV13zo1KAAACFAYh&categoryId=AV13zo1KAAACFAYh&categoryType=CODE&problemTitle=&orderBy=RECOMMEND_COUNT&selectCodeLang=CCPP&select-1=3&pageSize=10&pageIndex=1 

SW Expert Academy

---

#include <iostream>
#include <map>

using namespace std;

int main() {
	int T; cin >> T;
	for (int t = 0; t < T; t++) {
		int num; cin >> num;
		int biggest = 0;
		map<int, int> m;
		for (int i = 0; i < 1000; i++) {
			int n; cin >> n;
			m[n]++;
			if (m[biggest] == m[n]) {
				biggest = max(biggest, n);
			}
			else if(m[biggest] < m[n]){
				biggest = n;
			}
		}
		cout<<"#"<<num<<" " << biggest << endl;
	}
}