CF 1458B

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 110;
 
double dp[N][N * N];
int a[N], b[N];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n; cin >> n;
    for(int i = 1 ; i <= n ; i++){
        cin >> a[i] >> b[i];
    }
    memset(dp, ~0x3f, sizeof(dp));
    dp[0][0] = 0;
    for(int i = 1 ; i <= n ; i++){
        for(int j = n ; j >= 0 ; j--){
            for(int k = 10000 ; k >= 0 ; k--){
                dp[j][k] = max(dp[j][k], dp[j][k] + b[i] * 1.0 / 2);//
                if(j > 0 && k >= a[i]){
                    dp[j][k] = max(dp[j][k], dp[j - 1][k - a[i]] + b[i]);//背包，从后往前更新
                }
            }
        }
    }
    for(int i = 1 ; i <= n ; i++){
        double ans = 0;
        for(int j = 0 ; j <= 10000 ; j++){
            ans = max(ans, min(dp[i][j], 1.0 * j));//最后用容量更新
        }
        cout << fixed << setprecision(20) << ans << " ";
    }
    return 0;
}//韩教tql 

说实话还是没怎么看懂