Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 5298aee

Browse files
and-starlabuladong
authored andcommitted
Fix qn8gGX
1 parent de572d6 commit 5298aee

File tree

1 file changed

+4
-1
lines changed

1 file changed

+4
-1
lines changed

‎多语言解法代码/solution_code.md

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -50907,7 +50907,10 @@ public:
5090750907
vector<vector<int>> kSmallestPairs(vector<int>& nums1, vector<int>& nums2, int k) {
5090850908
// 存储三元组 (num1[i], nums2[i], i)
5090950909
// i 记录 nums2 元素的索引位置,用于生成下一个节点
50910-
priority_queue<vector<int>, vector<vector<int>>, greater<vector<int>>> pq;
50910+
auto cmp = [](auto & a, auto & b) {
50911+
return a[0] + a[1] > b[0] + b[1];
50912+
};
50913+
priority_queue<vector<int>, vector<vector<int>>, decltype(cmp)> pq(cmp);
5091150914
// 按照 23 题的逻辑初始化优先级队列
5091250915
for (int i = 0; i < nums1.size(); i++) {
5091350916
pq.push({nums1[i], nums2[0], 0});

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /