简单的递归:
#include<iostream>
#include <vector>
#include <algorithm>
using namespace std;
int MINlenth = 1000;
int n, m;
void dfs(int g, vector<int>vec)
{
if (n - m == g)
{
sort(vec.begin(), vec.end());
MINlenth = min(MINlenth, vec[n - 1] - vec[g]);
return;
}
for (int i = g+1; i < n; i++)//选择从n-1中木棍粘连
{
vector<int>dp = vec;
dp[g] += dp[i];//粘在一起,将选择的木棍归0并用sort排到最前面
dp[i] = 0;
sort(dp.begin(), dp.end());
dfs(g+1, dp);//因为最前面是0了,增加一个下标继续选
}
}
int main()
{
cin >> n >> m;
vector<int>vec(n, 0);
for (int i = 0; i < n; i++)
cin >> vec[i];
sort(vec.begin(), vec.end());
dfs(0, vec);//默认从第一根开始粘
cout << MINlenth;
}