| 4 | class Solution{ |
| 5 | public: |
| 6 | vector<pair<int,int>> allPairs(int A[], int B[], int N, int M, int X) |
| 7 | { |
| 8 | vector<pair<int,int>>v; |
| 9 | for(int i =0;i<N;i++){ |
| 10 | for(int j =0;j<M;j++){ |
| 11 | if(A[i]+B[j]==X){ |
| 12 | v.push_back({A[i],B[j]}); |
| 13 | } |
| 14 | } |
| 15 | } |
| 16 | sort(v.begin(),v.end()); |
| 17 | return v; |
| 18 | } |
| 19 | }; |
| 20 | |
| 21 |