[SW Expert Academy] 1204 최빈수 구하기

문제 출처

https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV13zo1KAAACFAYh

#include <iostream> #include <string.h> using namespace std; const int STUDENT = 1000; int T,testNum,ret; int arr[101]; int main(void) { int score; scanf("%d",&T); while(T--) { int max=0; memset(arr,0,sizeof(arr)); scanf("%d", &testNum); for(int i=0; i<STUDENT; i++) { scanf("%d", &score); arr[score]++; if(arr[score]>max) max=arr[score]; } for(int i=0; i<101; i++) { if(arr[i]==max) ret=i; } cout<<"#"<<testNum<<" "<<ret<<endl; } return 0; }