题解 | #结构体优先队列#

#include<bits/stdc++.h>
using namespace std;

struct node{
    int chinese, math, english, sum;
};

bool operator<(node a, node b){
    if (a.sum != b.sum) return a.sum < b.sum;
    if (a.chinese != b.chinese) return a.chinese < b.chinese;
    if (a.math != b.math) return a.math < b.math;
    return a.english < b.english;
}

priority_queue<node> s;

void insertValue(int chinese, int math, int english){
    s.push({chinese, math, english, chinese + math + english});
}

void deleteValue(){
    if (!s.empty()) {
        s.pop();
    }
}

node getTop(){
    if (!s.empty()) {
        return s.top();
    }
    return {}; // Should not be reached given problem constraints
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int q,op;
    int x, y, z;
    cin>>q;
    while(q--){
        cin>>op;
        if(op==1){
            cin>>x>>y>>z;
            insertValue(x, y, z);
        }
        if(op==2){
            node tmp = getTop();
            cout<<tmp.chinese<<" "<<tmp.math<<" "<<tmp.english<<endl;
        }
        if(op==3){
           deleteValue();
        }
    }
    return 0;
}

import java.util.*;

class Student {
    int chinese, math, english, sum;
    
    public Student(int chinese, int math, int english) {
        this.chinese = chinese;
        this.math = math;
        this.english = english;
        this.sum = chinese + math + english;
    }
}

public class Main {
    // 使用Java的PriorityQueue实现成绩排序
    static PriorityQueue<Student> s = new PriorityQueue<>(new Comparator<Student>() {
        @Override
        public int compare(Student a, Student b) {
            // 返回负数表示 a 的优先级更高
            if (a.sum != b.sum) return b.sum - a.sum;
            if (a.chinese != b.chinese) return b.chinese - a.chinese;
            if (a.math != b.math) return b.math - a.math;
            return b.english - a.english;
        }
    });
    
    public static void insertValue(int chinese, int math, int english) {
        s.add(new Student(chinese, math, english));
    }

    public static void deleteValue() {
        if (!s.isEmpty()) {
            s.poll();
        }
    }

    public static Student getTop() {
        if (!s.isEmpty()) {
            return s.peek();
        }
        return null;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int q = scanner.nextInt();
        while (q-- > 0) {
            int op = scanner.nextInt();
            if (op == 1) {
                int chinese = scanner.nextInt();
                int math = scanner.nextInt();
                int english = scanner.nextInt();
                insertValue(chinese, math, english);
            }
            if (op == 2) {
                Student top = getTop();
                if (top != null) {
                    System.out.println(top.chinese + " " + top.math + " " + top.english);
                }
            }
            if (op == 3) {
                deleteValue();
            }
        }
        scanner.close();
    }
}

import heapq

class Student:
    def __init__(self, chinese, math, english):
        self.chinese = chinese
        self.math = math
        self.english = english
        self.sum = chinese + math + english
    
    # heapq 是最小堆，成绩好的学生需要被认为是"更小"的
    def __lt__(self, other):
        if self.sum != other.sum:
            return self.sum > other.sum
        if self.chinese != other.chinese:
            return self.chinese > other.chinese
        if self.math != other.math:
            return self.math > other.math
        return self.english > other.english

# 使用Python的heapq模块实现优先队列
s = []

def insertValue(chinese, math, english):
    student = Student(chinese, math, english)
    heapq.heappush(s, student)

def deleteValue():
    if s:
        heapq.heappop(s)

def getTop():
    if s:
        return s[0]
    return None

if __name__ == "__main__":
    q = int(input())
    for _ in range(q):
        line = input().split()
        op = int(line[0])
        if op == 1:
            chinese = int(line[1])
            math = int(line[2])
            english = int(line[3])
            insertValue(chinese, math, english)
        elif op == 2:
            top = getTop()
            if top:
                print(f"{top.chinese} {top.math} {top.english}")
        elif op == 3:
            deleteValue()