题库练习 [COCI-2020-2021-olympiad]#1 Autobahn
← 上一题 下一题 →

A1399 | [COCI-2020-2021-olympiad]#1 Autobahn

来源COCI
时间限制1s
内存限制128MB
通过 / 提交0/0

题目描述

There are N people testing their racing cars on notorious autobahn where limits do not exist. In this task however limits do exist. So we kindly ask you to restrain yourself from submitting exponential complexity solutions.
Person i came to autobahn at the beginning of minute li , paid for ti minutes of stay and left at the end of minute ri . Unfortunately some stayed for longer than that they have paid for. Administration of autobahn decided not to be very harsh and charge them only for those extra minutes in which there were at least K people on autobahn.
In a rush of generosity, administration decided to introduce happy hour i.e. interval of continuous X minutes for which they won’t be paying extra charges. They picked happy hour so that the sum of extra charges that won’t be paid is maximal possible. Determine that sum.

输入格式

First line contains integers N, K and X (K ≤ N) from task description.
Next N lines contain integers li , ti and ri (li ≤ ri) from task description.

输出格式

Print the required sum in a single line.

输入输出样例

输入 #1
5 3 4
2 1 4
3 3 7
3 3 8
1 5 7
5 3 8
输出 #1
7
C++ 编辑器
输入
输出