#include <cmath>
#include <cstddef>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <cmath>
#include <ostream>
using namespace std;
const int space = 60;
//穷举法,把所有的可能都列出来,并且保存在一张表里
int getMinGroup2(int* num1, int *num2, int *num3, int size1, int size2, int size3)
{
//定义一个[3*4*5][4]的空间大小,4分别记录D值,第一个元组取的数,第二个元组取的数,第三个元组取的数
int temp[space][4] = {0};
int a,b,c;
int index = 0;
for(int i = 0; i < size1; i++)
{
a = num1[i];
for (int j = 0; j < size2; j++)
{
b = num2[j];
for(int k = 0; k < size3; k++)
{
c = num3[k];
int d = abss(a-b)+abss(b-c)+abss(c-a);
temp[index][0] = abss(a-b)+abss(b-c)+abss(c-a);
temp[index][1] = a;
temp[index][2]=b;
temp[index][3]=c;
index++;
}
}
}
int min = temp[0][0];//假设这个是最小的
int flag = 0;//标记取最小值得那个位置
for(int i = 1; i < space; i++)
{
if(temp[i][0] < min)
{
min = temp[i][0];
flag=i;
}
}
cout << "("<<temp[flag][1] << ","<<temp[flag][2] << "," <<temp[flag][3] << ")" <<endl;
return min;
}
int main()
{
int num1[3] = {-1,0,9};
int num2[4] = {-25, -10, 10, 11};
int num3[5] = {2,9,17,30,41};
int ans = getMinGroup2(num1, num2, num3,3,4,5);
cout << "最小D=" << ans << endl;
}