C++ beats 99.70%


  • 3
    B
    class Solution {
        struct cmp {
            bool operator() (const pair<int,int> &a, const pair<int,int> &b) {
                return a.first<b.first || (a.first==b.first && a.second>b.second);
            }  
        };
    public:
        vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
            vector<int> v;
            for(int i=0;i<people.size();i++) v.push_back(i);
            vector<pair<int, int>> res(people.size());
            sort(people.begin(), people.end(), cmp());
            for(auto &a:people) {
                res[v[a.second]] = a;
                v.erase(v.begin()+a.second);
            }
            return res;
        }
    };
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.