求证伪奇怪做法

void solution(){
    int n, m; in >> n >> m;
    for(int i = 1; i <= n; i++) in >> t[i];
    sort(t + 1, t + n + 1);
    memset(dp, 0x3f, sizeof dp);
    memset(f, 0x3f, sizeof f);
    dp[0] = 0, f[0] = -1e18;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < i; j++){
            LL st = max(f[j] + m, t[i]), c = 0;
            for(int k = j + 1; k <= i; k++){
                c += max(st - t[k], 0LL);
            }
            if(dp[j] + c < dp[i]){
                dp[i] = dp[j] + c, f[i] = st;
            } else if(dp[j] + c == dp[i] && st < f[i]){
                f[i] = st;
            }
        }
    }
    out << dp[n] << newl;
}