Easy C++ solution - beats 91.12% of C++ submissions (runtime).
\nclass Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& hc, vector<int>& vc) {\n        \n        hc.push_back(0);\n        hc.push_back(h);\n  
```\nclass Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& hc, vector<int>& vc) {\n        \n        hc.push_back(0);\n        hc.push_back(h);\n        vc.push_back(0);\n        vc.push_back(w);\n        int hn=hc.size(),vn=vc.size();\n        sort(hc.begin(),hc.end());\n        sort(vc.begin(),vc.end());\n        int maxh=0,maxv=0;\n        for(int i=1;i<hn;i++)\n            maxh=max(maxh,hc[i]-hc[i-1]);\n        for(int i=1;i<vn;i++)\n            maxv=max(maxv,vc[i]-vc[i-1]);\n        \n        return (long)maxh*maxv%1000000007;\n    }\n};\n```
['C', 'Sorting', 'C++']