#include "stdafx.h"
#include <stdio.h>
void sortArray(int a[], int n)
{
	if (a == NULL || n <= 0)
		printf("数组中无元素，排个毛啊。");
	else
	{
		int temp;
		for (int i = 0; i < n-1; i++)
		{
			for (int j = i + 1; j < n; j++)
			{
				if (a[i]>a[j])
				{
					a[i] = a[i] ^ a[j];
					a[j] = a[j] ^ a[i];
					a[i] = a[i] ^ a[j];
				}
			}
		}
	}
}
void findCouple(int a[], int b[], int An, int Bn,int sum)
{
	if (a == NULL || An <= 0 || b == NULL || Bn <= 0)
		printf("数组中无元素，找个毛啊。");
	else
	{
		for (int i = 0, j = Bn - 1; i < An, j >= 0;)
		{
			if (a[i] + b[j]>sum)
				j--;
			if (a[i] + b[j] == sum)
			{
				printf("%d,%d\n", a[i], b[j]);
				i++;
				j--;
			}
			if (a[i] + b[j] < sum)
				i++;
		}
	}
}
void main()
{
	int a[] = {1,3,1,5,2,0};
	int b[] = { 1, 4, 3, 1, 0, 1 };
	int An = sizeof(a) / sizeof(int);
	int Bn = sizeof(b) / sizeof(int);
	sortArray(a, An);
	sortArray(b, Bn);
	findCouple(a, b, An, Bn, 6);
	getchar();
}

#include "stdafx.h"
#include <iostream>
#include <map>
using namespace std;
void print_pairs_with_sum2(int A[], int B[], int m, int n, int sum)
{
	map<int, bool> hash_table;
	int *psmaller = A;
	int *pbigger = B;
	int nsmaller = (m >= n) ? n : m;
	int nbigger = (m >= n) ? m : n;
	if (m > n)
	{
		psmaller = B;
		pbigger = A;
	}
	for (int i = 0; i < nsmaller; i++)
	{
		hash_table.insert(pair<int, bool>(psmaller[i], true));
	}
	for (int i = 0; i < nbigger; i++)
	{
		if (hash_table.find(sum - pbigger[i])!= hash_table.end())
		{
			cout << "(" << pbigger[i] << "," << sum - pbigger[i] << ")" << endl;
		}
	}
}
void main()
{
	int a[] = { 1, 5, 4, 3, 2, 0 };
	int b[] = { 1, 4, 3, 1, 0, 1 ,};
	int m = sizeof(a) / sizeof(int);
	int n = sizeof(b) / sizeof(int);
	print_pairs_with_sum2(a, b, m, n, 6);
	getchar();
}