APS/SWEA
1204. [S/W 문제해결 기본] 1일차 - 최빈수 구하기
문래동까마귀
2021. 8. 24. 20:54
#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
int t, sun;
void run(int le) {
int dat[101] = { 0 };
cin >> sun;
int num;
for(int i=0; i<1000; i++){
cin >> num;
dat[num]++;
}
int max = -1;
int index;
for (int i = 0; i < 100; i++) {
if (max <= dat[i]) {
max = dat[i];
index = i;
}
}
cout << "#" << sun << " " << index << endl;
}
int main() {
cin >> t;
for (int i = 0; i < t; i++) {
run(i);
}
return 0;
}