동점에서 선택할 참가자

#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 a[2] < b[2];
    return a[0] > b[0];
}
int solution(vector<vector<int>> records, int k) {
    sort(records.begin(), records.end(), order);
    return records[k - 1][0];
}
int main() {
    int n, k; cin >> n >> k;
    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, k) << '\n';
}