Codeforces 853A Round#433 Div2C & Div1A Planning:优先队列或堆或排序
题意:有n(usingnamespacestd;constintMAX=3e5+100;intn,k;boolused[MAX];intans[MAX];structFlight{intcost,index;booloperatorpq;inlinevoidinput(){scanf("%d%d",&n,&k);for(inti=1;ik;i--){if(i<=n&&!used[i]){used[