슈뢰딩거의 고등어

https://programmers.co.kr/learn/courses/30/lessons/72412 s[1] >> str >> s[2] >> str >> s[3]; cout s[2] >> s[3]; cout s[2] >> s[3] >> str; addCases(s, (int)stoi(str)); } for(auto it=scores.begin(); it!=scores.end(); it++) sort(it->second.begin(), it->second.end()); for(int i=0; i> s[0] >> str >> s[1] >> str >> s[2] >> str >> s[3] >> str; score = stoi(str); vector v = scores[s[0]+s[1]+s[2]+s[3]]; ..