leetcode算法题--Russian Doll Envelopes

原题链接：https://leetcode.com/problems/russian-doll-envelopes/

class Solution {
public:
    struct node {
        int x, y;
    };
    bool cmp(const node& a, const node& b) {
        return a.x < a.y;
    }
    int maxEnvelopes(vector<vector<int>>& envelopes) {
        sort(envelopes.begin(), envelopes.end());
        cout << envelopes;
    }
    
};