二元组整数

代码：

#include<iostream>
using namespace std;
#include<algorithm>
int main()
{
	int n;
	int a[30] = { 0 };
	int b[30] = { 0 };
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
		b[i] = a[i];
	}
	sort(a, a + n);
	sort(b, b + n);
	for (int i = 0; i< n; i++)
	{
		for (int k = 0; k < n; k++)
		{
			if (i != k)
			{
				printf("(%d,%d)\n",a[i],b[k]);
				while (b[k] == b[k + 1])k++;
			}
		}
		while(a[i] == a[i + 1])i++;
	}
	return 0;
}