题解 | 小苯送礼物

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

 struct fans{
     int id=0;
     int  zan=0;
     int shou=0;
     int focus=0;

 };
 bool cmp(fans a,fans b ){
     if(a.focus==b.focus){
         if (a.shou==b.shou){
             return a.id<b.id;
         }
         return a.shou>b.shou;
     }
     return a.focus>b.focus;
 }
int main() {
    int a, b;
    cin>>a>>b;
    vector<fans> fan(a);
    for (int i = 0; i < a; ++i) {
        fan[i].id=i+1;
        cin>>fan[i].zan>>fan[i].shou;
        fan[i].focus=fan[i].shou*2+fan[i].zan;
    }
    sort(fan.begin(),fan.end(),cmp);
    vector<int>ans;
    for (int i  = 0; i < b; ++i) {
        ans.push_back(fan[i].id);
    }
    sort(ans.begin(),ans.end());
    for(auto i:ans){
        cout<<i<<" ";
    }
    cout<<"\n";
}
// 64 位输出请用 printf("%lld")