题解 | chika和蜜柑

#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main() {
 int n,k;
 cin>>n>>k;
 vector<pair<int,int>>oranges(n);
 for(int i=0;i<n;i++){
    cin>>oranges[i].first;
 }
  for(int i=0;i<n;i++){
    cin>>oranges[i].second;
 }
sort(oranges.begin(),oranges.end(),[](const pair<int,int>&x,const pair<int,int>&y){
    if(x.second!=y.second)
    {
        return x.second>y.second;
    }
    return x.first<y.first;
});

long long acid=0,sweet=0;
for(int i=0;i<k;i++){
    acid+=oranges[i].first;
    sweet+=oranges[i].second;
}
cout<<acid<<" "<<sweet<<endl;

}