.。。。。。

解题思路:

注意事项:

参考代码:

#include<iostream>

#include<algorithm>

#include<vector>

using namespace std;

int main()

{

long N, M;

cin >> N >> M;

vector<long>arr;

vector<long>fc;

vector<long>sum;

for (int i = 0; i < N; i++)

{

long index;

cin >> index;

arr.push_back(index);

}

sort(arr.begin(), arr.end());

//存方差

for (int i = 0; i < N - 1; i++)

{

fc.push_back(arr[i + 1] * arr[i + 1] - arr[i] * arr[i]);

}

//N-M个，//存值

for (int i = 0; i < N - M+1; i++)

{

sum.push_back(0);

for (int j = i; j < M+i-1; j++)

{

sum[i] += fc[j];

}

}

cout<<*min_element(sum.begin(), sum.end());

return 0;

}