TravellingSalesmanEasy.cpp

class TravellingSalesmanEasy {
    public:
    int getMaxProfit(int M, vector<int> profit, vector<int> city, vector<int> visit) {
      int ans=0;
      priority_queue<int> qu[M];
      for (int i=0; i < profit.size(); i++) {
        qu[city[i]-1].push(profit[i]);
      }
      for (int i=0; i < visit.size(); i++) {
        if(qu[visit[i]-1].empty())
          continue;
        ans+=qu[visit[i]-1].top();
        qu[visit[i]-1].pop();
      }
      return ans;
    }
};