上述代码好像看得混乱，重新发一下 #include<algorithm> using namespace std; struct Node { int num; int P; long long T; }s[10000]; bool cmp(Node a,Node b) { if(a.P>b.P) return true; else if(a.P==b.P) { if(a.T<b.T) return true; else if(a.num<b.num) return true; } return false; } int main() { // please define the C++ input here. For example: int a,b; cin>>a>>b;; // please finish the function body here. // please define the C++ output here. For example:cout<<____<<endl; int input; cin>>input; for(int i=0;i<input;i++) { cin>> s[i].num >>s[i].P >>s[i].T; } sort(s,s+input,cmp); for(int i=0;i<input;i++) { cout<<s[i].num<<" "; } return 0; }