题解 | 小苯送礼物

#include <bits/stdc++.h>
using namespace std;
struct Person
{
    int id;
    int x;
    int y;
    int power;
};
bool cmp(Person p1,Person p2)
{
    if(p1.power!=p2.power) return p1.power>p2.power;
    else if(p1.y!=p2.y) return p1.y>p2.y;
    else return p1.id<p2.id;
}
bool cmp1(Person p1,Person p2)
{
    return p1.id<p2.id;
}
const int N=1e5+9;
int main() {
   int n,k;cin>>n>>k;
    struct Person p[N];
    for(int i=1;i<=n;i++)
    {
        cin>>p[i].x>>p[i].y;
        p[i].id=i;
        p[i].power=p[i].x+p[i].y*2;
    }
    sort(p+1,p+1+n,cmp);
    int a[N];
    for(int i=1;i<=k;i++)
    {
        a[i]=p[i].id;
    }
    sort(a+1,a+k+1);
    for(int i=1;i<=k;i++) cout<<a[i]<<" ";
}
// 64 位输出请用 printf("%lld")