leetcodeSolution to some Leetcode problems written in C++ |
git clone git://git.dimitrijedobrota.com/leetcode.git |
Log | Files | Refs | README | LICENSE |
2054.cpp (651B)
0 class Solution { 1 public: 2 int maxTwoEvents(const vector<vector<int>> &events) const { 3 using type_t = tuple<int, int, int>; 4 vector<type_t> times; 5 6 times.reserve(2 * size(events)); 7 for (const auto &e : events) { 8 times.emplace_back(e[0], 1, e[2]); 9 times.emplace_back(e[1] + 1, 0, e[2]); 10 } 11 12 sort(begin(times), end(times)); 13 14 int res = 0, maxi = 0; 15 for (const auto [time, is_start, val] : times) { 16 if (is_start) 17 res = max(res, val + maxi); 18 else 19 maxi = max(maxi, val); 20 } 21 22 return res; 23 } 24 };