cf C. Hacker, pack your bags!
来源:互联网 发布:极光世界辅助软件 编辑:程序博客网 时间:2024/06/17 23:44
It's well known that the best way to distract from something is to do one's favourite thing. Job is such a thing for Leha.
So the hacker began to work hard in order to get rid of boredom. It means that Leha began to hack computers all over the world. For such zeal boss gave the hacker a vacation of exactly x days. You know the majority of people prefer to go somewhere for a vacation, so Leha immediately went to the travel agency. There he found out that n vouchers left. i-th voucher is characterized by three integers li, ri, costi— day of departure from Vičkopolis, day of arriving back in Vičkopolis and cost of the voucher correspondingly. The duration of the i-th voucher is a value ri - li + 1.
At the same time Leha wants to split his own vocation into two parts. Besides he wants to spend as little money as possible. Formally Leha wants to choose exactly two vouchers i and j (i ≠ j) so that they don't intersect, sum of their durations is exactly x and their total cost is as minimal as possible. Two vouchers i and j don't intersect if only at least one of the following conditions is fulfilled: ri < lj or rj < li.
Help Leha to choose the necessary vouchers!
The first line contains two integers n and x (2 ≤ n, x ≤ 2·105) — the number of vouchers in the travel agency and the duration of Leha's vacation correspondingly.
Each of the next n lines contains three integers li, ri and costi (1 ≤ li ≤ ri ≤ 2·105, 1 ≤ costi ≤ 109) — description of the voucher.
Print a single integer — a minimal amount of money that Leha will spend, or print - 1 if it's impossible to choose two disjoint vouchers with the total duration exactly x.
4 51 3 41 2 55 6 11 2 4
5
3 24 6 32 4 13 5 4
-1
In the first sample Leha should choose first and third vouchers. Hereupon the total duration will be equal to (3 - 1 + 1) + (6 - 5 + 1) = 5and the total cost will be 4 + 1 = 5.
In the second sample the duration of each voucher is 3 therefore it's impossible to choose two vouchers with the total duration equal to 2.
- cf C. Hacker, pack your bags!
- cf #422 c Hacker, pack your bags! 【贪心】
- Hacker, pack your bags!
- CF422 div2 C. Hacker, pack your bags!
- codeforces 822 C Hacker, pack your bags!
- Codeforces822 C. Hacker, pack your bags!
- 822C Hacker, pack your bags!
- Round 422 C. Hacker, pack your bags!
- codeforces 882C Hacker, pack your bags!
- CodeForces 822C Hacker, pack your bags!
- 822C Hacker, pack your bags!
- codeforces Hacker, pack your bags!
- cf822c Hacker,Pack your bags
- Hacker, pack your bags! CodeForces
- `Hacker, pack your bags!
- Codeforces Round #422 C. Hacker, pack your bags! (二分)
- Codeforces Round #422 (Div. 2) C. Hacker, pack your bags!
- CodeFroces 822C.Hacker, pack your bags!(sorting+线性枚举)
- IntelliJ IDEA创建Web SpringMVC项目(二):添加springMVC框架
- 高级程序员,你需要养成这7个习惯
- GNS3+SecureCRT使用方法
- 编译及eclipse问题,舞步学院自己的见解
- 在Android studio安装Generate GsonFormat插件
- cf C. Hacker, pack your bags!
- poj2398-Toy Storage 玩具放入纸盒升级版
- JSTL标签库
- CSS3知识点总结
- Springboot的定时器使用
- Storm1.1.0<消息的可靠性机制>
- 前端页面弹框遮罩禁止页面滚动
- 【android】使用部分模拟器出现兼容问题Error inflating class EditText
- Info.plist 权限设置