class Solution {

public:

    static bool cmp(vector<int> a,vector<int> b){

        return a[]<b[];

    }

    vector<vector<int>> merge(vector<vector<int>>& intervals) {

        vector<vector<int>> res;

        sort(intervals.begin(),intervals.end(),cmp);

        for(int i=;i<intervals.size();i++){

            int x=intervals[i][];int y=intervals[i][];

            while(i+<intervals.size()&&y>=intervals[i+][]){

                i++;

                y=max(intervals[i][],y);

            }

            res.push_back({x,y});

        }

        return res;

    }

};