題目連結

題意

每個人都可以解決A題和B題，得分分別是 $x_i$和 $y_i$

題解

現在有c和d兩個人組隊，他們對於A題和B題的得分分別是， $x_c,y_c$

程式碼

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3e5+5;

struct node {
    ll x,y;
    int id;
    ll val;
    bool operator <(const node& rhs) const {
        return val < rhs.val;
    }
}a[maxn], b[maxn];

ll prex[maxn], prey[maxn];
ll ans[maxn];
int n,m;
ll get(ll x, ll _x, ll _y, int pos) {
    ll px = pos;
    // cout << px <<" ";
    ll ret = 0;
    ret += prey[px]+_x*px;
    // cout << ret <<" ";
    ret += prex[n]-prex[px]+_y*(n-px);
    // cout << ret <<" ";
    ret -= (_x+_y);
    // cout << ret <<endl;
    
    return ret;
}
int main() {
    
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++i) {
        scanf("%lld%lld", &a[i].x, &a[i].y);
        a[i].val = a[i].y-a[i].x;
        b[i].x = a[i].x; b[i].y = a[i].y;
        a[i].id = i;
    }
    sort(a+1,a+n+1);
    // cout << a[4].val << endl;
    for(int i = 1; i <= n; ++i) {
        prex[i] = prex[i-1]+a[i].x;
        prey[i] = prey[i-1]+a[i].y;
    }
    for(int i = 1; i <= n; ++i) {
        // cout <<i <<" ";
        ans[a[i].id] = get(a[i].y-a[i].x, a[i].x, a[i].y, i);
        // cout << endl;
    }
    for(int i = 0; i < m; ++i) {
        ll u,v;
        scanf("%lld%lld", &u, &v);
        ll ret = min(b[u].x+b[v].y, b[u].y+b[v].x);
        // cout << ret << endl;
        ans[u] -= ret;
        ans[v] -= ret;
    }
    for(int i = 1; i <= n; ++i)
        cout << ans[i] <<" ";
    cout << endl;
    return 0;
}