You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

  给定$A, B, C$三个数组（长度依次为$n, m, p$），求出所有满足$A[i] + B[j] = C[k]$的组合，并按照$A[i], B[j], C[k]$的顺序保存每一组值。

Format

  你所提交的代码应具有如下形式

#include "Solution.h"

vector<vector<int>> Solution::three_sum(vector<int> &A, vector<int> &B, vector<int> &C) {
    // 请在这里完成你的代码

}