题解 | chika和蜜柑

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll n, m;
const ll N = 2e5 + 5;
struct node{
    ll t,s;
};
node work[N];
ll cmp(const node&p1,const node&p2){
    if(p1.t!=p2.t)return p1.t>p2.t;//使甜度尽可能大
    return p1.s<p2.s;//甜度相同时酸度尽可能小
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin>>n>>m;
    for(ll i=1;i<=n;i++){
        cin>>work[i].s;
    }
    for(ll i=1;i<=n;i++){
        cin>>work[i].t;
    }
    sort(work+1,work+n+1,cmp);//排序
    ll zs=0,zt=0;
    for(ll i=1;i<=m;i++){//吃掉前m个
        zs+=work[i].s;
        zt+=work[i].t;
    }
    cout<<zs<<" "<<zt;
    return 0;
}