感觉这题的套路要比“【51nod】1494 选举拉票”那题要简单啊……大雾
在这题把每一条腿的长度看成线段,从小到大枚举一个长度
i
,长度大于
然而我TMD线段树打错了,
query(lt,l,mid,w)
打成了
query(lt,l,mid+1,w)
,整整WA了6发……我觉得我应该多去敲一下板子的
附上AC代码:
#include <cstdio>
#include <cctype>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
const int N=1e5+10;
struct note{
int l,w;
}a[N];
vector <int> b[N];
int n,m,cnt,mx;
ll sum,add,ans,num[N<<2],t[N<<2];
inline char nc(){
static char ch[100010],*p1=ch,*p2=ch;
return p1==p2&&(p2=(p1=ch)+fread(ch,1,100010,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &a){
static char c=nc();int f=1;
for (;!isdigit(c);c=nc()) if (c=='-') f=-1;
for (a=0;isdigit(c);a=a*10+c-'0',c=nc());
return (void)(a*=f);
}
#define lt (k<<1)
#define rt (k<<1|1)
#define mid (l+r>>1)
inline void change(int k,int l,int r,int w){
if (l==r&&l==w) return (void)(++num[k],t[k]+=1ll*w);
if (w<=mid) change(lt,l,mid,w);
else change(rt,mid+1,r,w);
return (void)(num[k]=num[lt]+num[rt],t[k]=t[lt]+t[rt]);
}
inline ll query(int k,int l,int r,int w){
if (l==r) return 1ll*l*w;
if (num[lt]==w) return t[lt];
if (w<num[lt]) return query(lt,l,mid,w);
else return t[lt]+query(rt,mid+1,r,w-num[lt]);
}
int main(void){
read(n);
for (int i=1; i<=n; ++i) read(a[i].l),m=max(m,a[i].l);
for (int i=1; i<=n; ++i){
read(a[i].w),mx=max(mx,a[i].w);
b[a[i].l].push_back(a[i].w),sum+=1ll*a[i].w;
}
ans=1e18;
for (int i=1; i<=m; ++i)
if (b[i].size()){
cnt+=b[i].size();
for (int j=0; j<b[i].size(); ++j) sum-=1ll*b[i][j];
if (cnt>=b[i].size()) add=query(1,1,mx,cnt-b[i].size()*2+1); else add=0;
ans=min(ans,sum+add);
for (int j=0; j<b[i].size(); ++j) change(1,1,mx,b[i][j]);
}
return printf("%lld\n",ans),0;
}