[프로그래머스]베스트앨범

https://programmers.co.kr/learn/courses/30/lessons/42579#

코딩테스트 연습 - 베스트앨범 | 프로그래머스

 

문제를 잘읽자

#include <string>
#include <vector>
#include <unordered_map>
#include <iostream>
#include <algorithm>
using namespace std;
 
struct INFO{
    int idx;
    string name;
    int total_cnt;
    int cnt;
};
 
bool cmp(const INFO a,const INFO b){
    if(a.total_cnt > b.total_cnt) return true;
    else if(a.total_cnt < b.total_cnt) return false;
    else {
        if(a.cnt > b.cnt) return true;
        else if(a.cnt < b.cnt) return false;
        else{
            if(a.idx < b.idx) return true;
            else return false;
        }
    }
}
 
vector<int> solution(vector<string> genres, vector<int> plays) {
    vector<int> answer;
    vector<INFO> v;
    unordered_map<string,int> m;
    for(int i=0;i<genres.size();i++) m[genres[i]]+=plays[i];
    for(int i=0;i<genres.size();i++) v.push_back({i,genres[i],m[genres[i]],plays[i]}); 
    sort(v.begin(),v.end(),cmp);
    string name ="";
    for(int i=0;i<v.size()-1;i++){
        if(v[i].name==name)continue;
        if(v[i].name==v[i+1].name){
            name=v[i].name;
            answer.push_back(v[i].idx);
            answer.push_back(v[i+1].idx);
            i++;
        }else{
            if(v[i].total_cnt==v[i].cnt) answer.push_back(v[i].idx);
        }
    }if(v[v.size()-1].total_cnt==v[v.size()-1].cnt) answer.push_back(v[v.size()-1].idx);
    
    return answer;
}