薪得体会（2025牛客寒假算法基础集训营6）

#include 

#define endl '\n'
#define int ll
using ll = long long;
typedef unsigned long long ull;
using namespace std;

void GordenGhost();

signed main() {
#ifdef Gorden
    freopen("in.txt", "rt", stdin);
    freopen("out.txt", "wt", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int t;
    cin>>t;
    while (t--)
        GordenGhost();
    return 0;
}

void GordenGhost() {
    int n;
    cin>>n;
    vector>w(n+1);
    vectorans(n+1);
    vectormac(n+1);
    for (int i = 1; i <= n; ++i) cin>>w[i][0]>>w[i][1];
    sort(w.begin()+1,w.end(),[&](auto&a,auto&b){
        return a[0]+a[1]=w[i][0]) {
            ans[i]= max(ans[i],w[i][0]+w[i][1]);
        }else {
            ans[i]= max(ans[i],w[i-1][0]+w[i-1][1]);
        }
        ans[i]= max(ans[i],w[i][0]);
    }
    cout<