C. Party Lemonade
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
A New Year party is not a New Year party without lemonade! As usual, you are expecting a lot of guests, and buying lemonade has already become a pleasant necessity.
Your favorite store sells lemonade in bottles of n different volumes at different costs. A single bottle of type i has volume 2i - 1 liters and costs ci roubles. The number of bottles of each type in the store can be considered infinite.
You want to buy at least L liters of lemonade. How many roubles do you have to spend?
Input
The first line contains two integers n and L (1 ≤ n ≤ 30; 1 ≤ L ≤ 109) — the number of types of bottles in the store and the required amount of lemonade in liters, respectively.
The second line contains n integers c1, c2, ..., cn (1 ≤ ci ≤ 109) — the costs of bottles of different types.
Output
Output a single integer — the smallest number of roubles you have to pay in order to buy at least L liters of lemonade.
Examples
input
Copy
4 12 20 30 70 90
output
Copy
150
input
Copy
4 3 10000 1000 100 10
output
Copy
10
input
Copy
4 3 10 100 1000 10000
output
Copy
30
input
Copy
5 787787787 123456789 234567890 345678901 456789012 987654321
output
Copy
44981600785557577
Note
In the first example you should buy one 8-liter bottle for 90 roubles and two 2-liter bottles for 30 roubles each. In total you'll get 12 liters of lemonade for just 150 roubles.
In the second example, even though you need only 3 liters, it's cheaper to buy a single 8-liter bottle for 10 roubles.
In the third example it's best to buy three 1-liter bottles for 10 roubles each, getting three liters for 30 roubles.
题意是给你n种柠檬水,每种柠檬水有2^(i - 1)次方的体积和c[i]的价格,现在他需要L升,问你最少需要花费多少钱可以买到L升的柠檬水。
所谓奇淫技巧,我们可以贪心解决,首先因为他是2的次幂顺序放置的,所以我们可以先把所有2^i次幂饮料所需要的最小值预处理出来(在这儿一定要从前面向后处理,因为你可以两个4L的买成8L的,但绝不能8L买一半变成4L吧,这大家想一下就可以知道。),然后我们从后枚举每一个体积,因为我们是处理出来当前体积中最小的花费了,所以对于每一个体积,知道他能取到,我们就让他购买,一直遍历到最后,就能找到答案。
代码如下:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 50;
int c[maxn];
int main() {
int n, L;
cin >> n >> L;
for (int i = 0; i < n; i++) cin >> c[i];
for (int i = 0; i < n - 1; i++)
c[i + 1] = min(c[i + 1], 2 * c[i]);
long long ans = (long long) 2e18;
long long sum = 0;
for (int i = n - 1; i >= 0; i--) {
int need = L / (1 << i);
sum += (long long) need * c[i];
L -= need << i;
ans = min(ans, sum + (L > 0) * c[i]);
}
cout << ans << endl;
return 0;
}