Time: 957 ms (13.56%), Space: 86.6 MB (17.00%) - LeetHub

1353-maximum-number-of-events-that-can-be-attended/1353-maximum-number-of-events-that-can-be-attended.cpp

@@ -0,0 +1,37 @@
+class Solution {
+public:
+	static const bool mySort(vector<int> &a, vector<int> &b) {
+		if (a[0] != b[0]) {
+			return a[0] < b[0];
+		}
+		return a[1] < b[1];
+	}
+
+	int maxEvents(vector<vector<int>>& events) {
+		sort(events.begin(), events.end(), mySort);
+
+		int n = events.size();
+		int ans = 0;
+		int i = 0;
+
+		multiset<int> s;
+		for (int d = 1; d < 100001; ++d) {
+			while (!s.empty() && *(s.begin()) < d) {
+				s.erase(s.begin());
+			}
+
+			while (i < n && events[i][0] == d) {
+				s.insert(events[i][1]);
+				i++;
+			}
+
+			if (s.size() > 0) {
+				ans++;
+				s.erase(s.begin());
+			}
+		}
+
+		return ans;
+
+	}
+};