class Solution { public: //Function to find the maximum number of meetings that can //be performed in a meeting room. int maxMeetings(int start[], int end[], int n) { // Your code here using pi = pair<int,int> ; vector<pi> vp; for(int i = 0; i < n; i++) vp.push_back({start[i] , end[i]}); sort(vp.begin(), vp.end(),[](auto a, auto b){ return a.second < b.second; }); int ans = 0, r = INT_MIN; for(int i =0 ; i < n ; i++){ if(vp[i].first > r){ ans++; r = vp[i].second; } } return ans; } };
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter