RT,思路跟官方题解几乎一样:
就是把行李按价值从大到小排序,然后依次把每个行李放在能装下它的容量最小的箱子里
然后14 AC, 17 WA
求捉虫/kel
#include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
const int Maxn=60;
struct node{
int w,v;
}g[Maxn];
int a[Maxn];
int n,m,q;
bool cmp(node x,node y)
{
return x.v>y.v;
}
inline int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0' && ch<='9')s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*w;
}
int main()
{
// freopen("in.txt","r",stdin);
n=read(),m=read(),q=read();
for(int i=1;i<=n;++i)
g[i].w=read(),g[i].v=read();
sort(g+1,g+1+n,cmp);
for(int i=1;i<=m;++i)
a[i]=read();
while(q--)
{
int x=read(),y=read();
vector <int> c;
for(int i=1;i<x;++i)
c.push_back(a[i]);
for(int i=y+1;i<=m;++i)
c.push_back(a[i]);
sort(c.begin(),c.end());
int ans=0;
for(int i=1;i<=n;++i)
{
if(!c.size())break;
if(g[i].w>c[c.size()-1])continue;
ans+=g[i].v;
for(int j=c.size()-1;j>=0;--j)
{
if(!j){c.erase(c.begin()+j);break;}
if(c[j]<g[i].w)
{c.erase(c.begin()+j+1);break;}
}
}
printf("%d\n",ans);
}
return 0;
}