같은 점수의 순위

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool order(vector<int> a, vector<int> b) {
    if (a[1] != b[1]) return a[1] > b[1];
    if (a[2] != b[2]) return /*@blank1@*/;
    return a[0] < b[0];
}
int solution(vector<vector<int>> records) {
    sort(records.begin(), records.end(), order);
    int rank = 1, total = 0;
    for (int i = 0; i < (int)records.size(); ++i) {
        if (i > 0 && (/*@blank2@*/)) rank = /*@blank3@*/;
        total += records[i][0] * rank;
    }
    return total;
}
int main() {
    int n; cin >> n;
    vector<vector<int>> records(n, vector<int>(3));
    for (int i = 0; i < n; ++i) cin >> records[i][0] >> records[i][1] >> records[i][2];
    cout << solution(records) << '\n';
}