bzoj 4247挂饰

背包？？？？不会。。。

 #include<bits/stdc++.h>
 #define INF 0x7fffffff
 #define LL long long
 #define N 100005
 using namespace std;
 inline int ra()
 {
     int x=,f=; char ch=getchar();
     while (ch<'' || ch>'') {if (ch=='-') f=-; ch=getchar();}
     while (ch>='' && ch<='') {x=x*+ch-''; ch=getchar();}
     return x*f;
 }
 struct node{int a,b;}a[N];
 LL f[][];
 bool cmp(node a, node b){return a.a>b.a;}
 int main()
 {
     int n=ra();
     for (int i=; i<=n; i++) a[i].a=ra(),a[i].b=ra();
     sort(a+,a+n+,cmp);
     for (int i=; i<=n; i++) for (int j=; j<=n+; j++) f[i][j]=-0x3f3f3f3f; f[][]=;
     for (int i=; i<=n; i++)
         for (int j=; j<=n; j++)
             f[i][j]=max(f[i-][j],f[i-][max(j-a[i].a,)+]+a[i].b);
     LL ans=-0x3f3f3f3f;
     for (int i=; i<=n; i++)
         ans=max(ans,f[n][i]);
     cout<<ans;
     return ;
 }