【编程题-错题集】chika 和蜜柑（排序 / topK）

#include <iostream>
#include <algorithm>
using namespace std;
 
typedef long long LL;
const int N=200010;
 
struct fruits
{
    LL a;
    LL b;
    static bool cmp(const fruits& x, const fruits& y)
    {
        if(x.b==y.b) return x.a<y.a;
        return x.b>y.b;
    }
}f[N];
 
int main()
{
    int n, k;
    cin >> n >> k;
    for(int i=0; i<n; i++) cin >> f[i].a;
    for(int i=0; i<n; i++) cin >> f[i].b;
    sort(f, f+n, fruits::cmp);
    LL sum_a=0, sum_b=0;
    for(int i=0; i<k; i++)
    {
        sum_a+=f[i].a;
        sum_b+=f[i].b;
    }
    cout << sum_a << ' ' << sum_b << endl;
 
    return 0;
}

#include <iostream>
#include <algorithm>
 
using namespace std;
 
const int N = 2e5 + 10;
 
typedef pair<int, int> PII; // <酸度，甜度>
 
PII arr[N];
int n, k;
 
int main()
{
    cin >> n >> k;
    for(int i = 0; i < n; i++) cin >> arr[i].first;
    for(int i = 0; i < n; i++) cin >> arr[i].second;
 
    sort(arr, arr + n, [&](const PII& a, const PII& b)
    {
        if(a.second != b.second) return a.second > b.second;
        else return a.first < b.first;
    });
 
    long long s = 0, t = 0;
    for(int i = 0; i < k; i++)
    {
        s += arr[i].first;
        t += arr[i].second;
    }
 
    cout << s << " " << t << endl;
 
    return 0;
}