退役了好久没写题,今天晚上睡不着写一发.
这题仔细一想其实不难,按照每个位的性价比排序,然后安最便宜的枚举,然后假设比当前位低的位不用,只需要买这一位就行(二进制就这样,而且题目说可以比给定的值大),更新答案.
一发AC ,中间因为变量定义出了问题,调了一会儿
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 35;
typedef long long ll;
struct node
{
ll v;
long double value;
int id;
bool operator < (const node& T) const{
if(value==T.value) return id<T.id;
return value < T.value;
}
}b[maxn];
int bit[maxn];
int main()
{
//printf("%lld\n",98473473ll*456789012ll);
int n,c,len=0;
scanf("%d%d",&n,&c);
for(int i=0;i<n;i++)
scanf("%lld",&b[i].v);
ll p = 1ll;
int tmp = c;
while(tmp)
{
bit[len++] = tmp&1;
tmp>>=1;
}
for(int i=0;i<n;i++)
{
b[i].id =i;
b[i].value = (long double)b[i].v/p;
p *= 2ll;
}
ll ans = 0ll;
ll aans = -1ll;
sort(b,b+n);
for(int i=0;i<n;i++)
{
int tid = b[i].id;
int flag = 1;
for(int j=0;j<tid;j++)
{
if(bit[j]) flag = 0;
}
ll sum = 0ll;
ll pp = 1ll;
for(int j=tid;j<len;j++)
{
sum += pp*bit[j];
bit[j] = 0;
pp *= 2ll;
}
ll tmp = 0ll;
ans += sum * b[i].v;
if(!flag)
{
tmp += b[i].v;
}
if(aans==-1) aans = ans+tmp;
else aans = min(ans+tmp,aans);
//printf("%lld\n",sum*b[i].v);
}
printf("%lld\n",aans);
return 0;
}