网易堆棋子（%60通过率版，超时）

#include<iostream>
#include<vector>
#include<algorithm>
#include<climits>
using namespace std;
class solution
{
public:
vector<int> min_step(vector<int> x, vector<int> y, int n)
{
vector<int> dist(n, 0);//为向量赋初值
vector<int> re(n,INT_MAX);//使用INT_MAX需要添加climits头文件
int max_x = *max_element(x.begin(), x.end());
int min_x = *min_element(x.begin(), x.end());
int max_y = *max_element(y.begin(), y.end());
int min_y = *min_element(y.begin(), y.end());
for (int i = min_x; i <= max_x; i++)
{
for (int j = min_y; j <= max_y; j++)
{
for (size_t k = 0; k < n; k++)
{
dist[k]=abs(i - x[k]) + abs(j - y[k]);
}
sort(dist.begin(), dist.end());//对每个点到假设目标点的距离进行排序，理解这一步和接下来几步很关键
int temp=0;
for (size_t k = 0; k < n; k++)
{
temp += dist[k];//假设目标点放置k个棋子时该假设目标点需要的步骤，这里有个暗含的假设，该假设目标点放置k个棋子的最短步骤是移动距离该假设目标点最近的k棋子，这是符合事实和逻辑的
if (temp<re[k])//对比假设目标点之间当该点被放置k个棋子时需要的步骤
re[k]=temp;//选取放置k个棋子时最小的步骤数
}
}
}
return re;
}
};
int main()
{
int n;

vector<int> re;
solution s;
cin >> n;
vector<int> x(n,0);
vector<int> y(n,0);
for (int i = 0; i < n; i++)
{
cin >> x[i];
}
for (int j = 0; j < n; j++)
{
cin >> y[j];
}
re=s.min_step(x,y,n);
for (int i = 0; i < n; i++)
       { if(i==n-1)
cout << re[i];
    else
        cout<<re[i]<<' ';
        }
return 0;
}