|
||||||||||
Warching TVTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 619 Accepted Submission(s): 245 Problem Description Lemon likes warching TV very much. When winter holiday comes, it is a good time, isn¡¯t it. There are lots of TV program listed on the paper. Every TV program has its start time ,end time, and the happiness value that will add Lemon¡¯s happiness and it depends on Lemon¡¯s taste. Input There are many test cases. Please process to end of file. Each test case starts with one integer N (1 <= N <= 100000) which indicates the size of the list of the TV program. Then N lines follow, each line contains three integers s, e and v. s, e indicate that the TV program is during [s, e](1 <= s <= e <= 1000000). v indicates that after warching the TV program will add Lemon v happyiness(1 <= v <= 1000). Once Lemon choose a TV program, he must finish warching the TV program. Output Print the maximum happiness value that Lemon will get. Sample Input
Sample Output
Author lemon Source | ||||||||||
|