LeetCode "Russian Doll Envelopes"

An intuitive DP - should be 'medium'.

class Solution {
public:
    int maxEnvelopes(vector<pair<int, int>>& envelopes) {
        int n = envelopes.size();
        if (!n) return ;
        if (n == ) return ;

        //  Sort by Area
        sort(envelopes.begin(), envelopes.end(), [](const pair<int, int> &e1, const pair<int, int> &e2){
            return (e1.first *e1.second) < (e2.first *e2.second);
        });

        int ret = ;
        vector<int> dp(n, );
        for(int i = ; i < n; i ++)
        {
            pair<int, int> &ce = envelopes[i];
            for(int j = ; j < i; j ++)
            {
                pair<int, int> &cp = envelopes[j];
                if((ce.first > cp.first && ce.second > cp.second)
                    )
                {
                    dp[i] = max(dp[i], dp[j] + );
                }
                ret = max(ret, dp[i]);
            }
        }

        return ret;
    }
};