c++/sorting
find the maximun different between horizontalCuts and VerticalCut\n\n\n\n int maxArea(int h, int w, vector<int>& vech, vector<int>& vecr) {\n        \n        s
### find the maximun different between horizontalCuts and VerticalCut\n\n\n```\n int maxArea(int h, int w, vector<int>& vech, vector<int>& vecr) {\n        \n        sort(vech.begin(),vech.end());\n        sort(vecr.begin(),vecr.end());\n        \n         int h1=0,w1=0;\n        \n         h1=max(h1,vech[0]-0);\n         h1=max(h1,h-vech[vech.size()-1]);\n        \n         w1=max(w1,vecr[0]-0);\n         w1=max(w1,w-vecr[vecr.size()-1]);\n       \n\t     for(int i=1;i<vech.size();i++)\n        {\n            h1=max(h1,vech[i]-vech[i-1]);\n        }\n       \n        for(int i=1;i<vecr.size();i++)\n        {\n            w1=max(w1,vecr[i]-vecr[i-1]);\n        }\n          return ((long long)h1*(long long )w1)%1000000007;\n        \n    }\n```
[]