C++||Easy&Simple||Sorting
\nclass Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& hc, vector<int>& vc) {\n        int m =1e9 +7;\n        sort(hc.begin(),hc.end());\n    
```\nclass Solution {\npublic:\n    int maxArea(int h, int w, vector<int>& hc, vector<int>& vc) {\n        int m =1e9 +7;\n        sort(hc.begin(),hc.end());\n        sort(vc.begin(),vc.end());\n        \n\t\t\n        int max_h=hc[0], max_w=vc[0], i;\n        \n        for(i=1; i<hc.size(); ++i)\n            max_h = max(max_h, hc[i]-hc[i-1]);\n        max_h = max(max_h, h-hc[i-1]);\n        \n        for(i=1; i<vc.size(); ++i)\n            max_w = max(max_w, vc[i]-vc[i-1]);\n        max_w = max(max_w, w-vc[i-1]);\n        return ((long long)max_h*max_w)%m;\n    }\n};\n```
['C', 'Sorting']