vector<pair<int, int>>或者有序map

功能相同

  static bool sortPair(pair<int, int> a, pair<int, int> b) {
    return a.second > b.second;
  }
  vector<string> findRelativeRanks(vector<int> &score) {
    vector<string> res(score.size());

    vector<pair<int, int>> pairr;

    for (int i = 0; i < score.size(); i++) {
      pairr.push_back(pair<int, int>(i, score[i]));
    }

    sort(pairr.begin(), pairr.end(), sortPair);
    for (int i = 0; i < pairr.size(); i++) {
      switch (i) {
      case 0:
        res[pairr[i].first] = "Gold Medal";
        break;
      case 1:
        res[pairr[i].first] = "Silver Medal";
        break;
      case 2:
        res[pairr[i].first] = "Bronze Medal";
        break;
      default:
        res[pairr[i].first] = to_string(i + 1);
        break;
      }
    }
    return res;
  }

    vector<string> findRelativeRanks(vector<int>& score) {
        int n=score.size();
        map<int,int,greater<int>>num2index;
        for(int i=0;i<n;i++)num2index[score[i]]=i;
        vector<string>ans(n);
        int i=0;
        for(auto mPair:num2index){
            int index=mPair.second;
            if(i==0){
                ans[index]="Gold Medal";
            }else if(i==1){
                ans[index]="Silver Medal";
            }else if(i==2){
                ans[index]="Bronze Medal";
            }else ans[index]+=to_string(i+1);
            i++;
        }
        return ans;
    }