maximum-number-of-events-that-can-be-attended-ii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array of <code>events</code> where <code>events[i] = [startDayi, endDayi, valuei]</code>. The <code>ith</code> event starts at <code>startDayi</code> and ends at <code>endDayi</code>, and if you attend this event, you will receive a value of <code>valuei</code>. You are also given an integer <code>k</code> which represents the maximum number of events you can attend.

You can only attend one event at a time. If you choose to attend an event, you must attend the entire event. Note that the end day is inclusive: that is, you cannot attend two events where one of them starts and the other ends on the same day.

Return the maximum sum of values that you can receive by attending events.

&nbsp;
Example 1:

<img alt="" src="https://assets.leetcode.com/uploads/2021/01/10/screenshot-2021-01-11-at-60048-pm.png" style="width: 400px; height: 103px;" />

<pre>
Input: events = [[1,2,4],[3,4,3],[2,3,1]], k = 2
Output: 7
Explanation: Choose the green events, 0 and 1 (0-indexed) for a total value of 4 + 3 = 7.</pre>

Example 2:

<img alt="" src="https://assets.leetcode.com/uploads/2021/01/10/screenshot-2021-01-11-at-60150-pm.png" style="width: 400px; height: 103px;" />

<pre>
Input: events = [[1,2,4],[3,4,3],[2,3,10]], k = 2
Output: 10
Explanation: Choose event 2 for a total value of 10.
Notice that you cannot attend any other event as they overlap, and that you do not have to attend k events.</pre>

Example 3:

<img alt="" src="https://assets.leetcode.com/uploads/2021/01/10/screenshot-2021-01-11-at-60703-pm.png" style="width: 400px; height: 126px;" />

<pre>
Input: events = [[1,1,1],[2,2,2],[3,3,3],[4,4,4]], k = 3
Output: 9
Explanation: Although the events do not overlap, you can only attend 3 events. Pick the highest valued three.</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= k &lt;= events.length</code></li>
	<li><code>1 &lt;= k * events.length &lt;= 106</code></li>
	<li><code>1 &lt;= startDayi &lt;= endDayi &lt;= 109</code></li>
	<li><code>1 &lt;= valuei &lt;= 106</code></li>
</ul>

maxValue

Maximum Number of Events That Can Be Attended II

Maximum Number of Events That Can Be Attended

maximum-number-of-events-that-can-be-attended

最多可以参加的会议数目

Maximum Earnings From Taxi

maximum-earnings-from-taxi

出租车的最大盈利

Two Best Non-Overlapping Events

two-best-non-overlapping-events

两个最好的不重叠活动

Meeting Rooms III

meeting-rooms-iii

会议室 III

Array

Binary Search

Dynamic Programming

Sorting

给你一个 <code>events</code> 数组，其中 <code>events[i] = [startDayi, endDayi, valuei]</code> ，表示第 <code>i</code> 个会议在 <code>startDayi</code> 天开始，第 <code>endDayi</code> 天结束，如果你参加这个会议，你能得到价值 <code>valuei</code> 。同时给你一个整数 <code>k</code> 表示你能参加的最多会议数目。

你同一时间只能参加一个会议。如果你选择参加某个会议，那么你必须 完整 地参加完这个会议。会议结束日期是包含在会议内的，也就是说你不能同时参加一个开始日期与另一个结束日期相同的两个会议。

请你返回能得到的会议价值 最大和 。

 

示例 1：

<img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2021/02/06/screenshot-2021-01-11-at-60048-pm.png" style="width: 400px; height: 103px;" />

<pre>
输入：events = [[1,2,4],[3,4,3],[2,3,1]], k = 2
输出：7
解释：选择绿色的活动会议 0 和 1，得到总价值和为 4 + 3 = 7 。</pre>

示例 2：

<img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2021/02/06/screenshot-2021-01-11-at-60150-pm.png" style="width: 400px; height: 103px;" />

<pre>
输入：events = [[1,2,4],[3,4,3],[2,3,10]], k = 2
输出：10
解释：参加会议 2 ，得到价值和为 10 。
你没法再参加别的会议了，因为跟会议 2 有重叠。你 不 需要参加满 k 个会议。</pre>

示例 3：

<img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2021/02/06/screenshot-2021-01-11-at-60703-pm.png" style="width: 400px; height: 126px;" />

<pre>
输入：events = [[1,1,1],[2,2,2],[3,3,3],[4,4,4]], k = 3
输出：9
解释：尽管会议互不重叠，你只能参加 3 个会议，所以选择价值最大的 3 个会议。</pre>

 

提示：

<ul>
	<li><code>1 <= k <= events.length</code></li>
	<li><code>1 <= k * events.length <= 106</code></li>
	<li><code>1 <= startDayi <= endDayi <= 109</code></li>
	<li><code>1 <= valuei <= 106</code></li>
</ul>