CF859F.Ordering T-Shirts
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
It's another Start[c]up, and that means there are T-shirts to order. In order to make sure T-shirts are shipped as soon as possible, we've decided that this year we're going to order all of the necessary T-shirts before the actual competition. The top C contestants are going to be awarded T-shirts, but we obviously don't know which contestants that will be. The plan is to get the T-Shirt sizes of all contestants before the actual competition, and then order enough T-shirts so that no matter who is in the top C we'll have T-shirts available in order to award them.
In order to get the T-shirt sizes of the contestants, we will send out a survey. The survey will allow contestants to either specify a single desired T-shirt size, or two adjacent T-shirt sizes. If a contestant specifies two sizes, it means that they can be awarded either size.
As you can probably tell, this plan could require ordering a lot of unnecessary T-shirts. We'd like your help to determine the minimum number of T-shirts we'll need to order to ensure that we'll be able to award T-shirts no matter the outcome of the competition.
输入格式
Input will begin with two integers N and C ( 1<=N<=2⋅105 , 1<=C ), the number of T-shirt sizes and number of T-shirts to be awarded, respectively.
Following this is a line with 2⋅N−1 integers, s1 through s2⋅N−1 (0<=si<=108) . For odd i , si indicates the number of contestants desiring T-shirt size ((i+1)/2) . For even i , si indicates the number of contestants okay receiving either of T-shirt sizes (i/2) and (i/2+1) . C will not exceed the total number of contestants.
输出格式
Print the minimum number of T-shirts we need to buy.
输入输出样例
输入#1
2 200 100 250 100
输出#1
200
输入#2
4 160 88 69 62 29 58 52 44
输出#2
314
说明/提示
In the first example, we can buy 100 of each size.