UVALive 4850 Installations——思维

按d排序保证最大惩罚最小，但是此时次大惩罚+最大惩罚不一定最小，可以牺牲一个任务使得最大惩罚增大，次大惩罚减小使得最终答案减小

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000;
int T, N, ans;
struct Data {
    int s, d, x;
    bool operator < (const Data& rhs) const {
        if (d != rhs.d) return d < rhs.d;
        return s < rhs.s;
    }
}node[maxn], temp[maxn];
void solve() {
    int t = 0, maxv = 0, maxv_ = 0;
    for (int i = 1; i <= N; i++) {
        t += temp[i].s;
        if (t - temp[i].d > maxv_) {
            maxv_ = t - temp[i].d;
        }
        if (maxv_ > maxv) swap(maxv_, maxv);
    }
    ans = min(ans, maxv + maxv_);
}
int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &N);
        for (int i = 1; i <= N; i++) scanf("%d %d", &node[i].s, &node[i].d);
        sort(node+1, node+N+1);
        int t = 0, maxv = 0, maxv_ = 0, pos;
        for (int i = 1; i <= N; i++) {
            t += node[i].s;
            if (t - node[i].d >= maxv_) {
                pos = i;
                maxv_ = t - node[i].d;
            }
            if (maxv_ > maxv) swap(maxv_, maxv);
        }
        ans = maxv + maxv_;
        for (int i = pos+1; i <= N; i++) temp[i] = node[i];
        for (int i = 1; i < pos; i++) {
            for (int j = 1; j < i; j++) temp[j] = node[j];
            for (int j = i; j < pos; j++) temp[j] = node[j+1];
            temp[pos] = node[i];
            solve();
        }
        printf("%d\n", ans);
    }
    return 0;
}