P1109 学生分组 - 洛谷
代码区：
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
int locate[2];
int arry[55];
int cmp(const int& a, const int& b) {return a>b;
}
int main() {int n,add=0,sub=0,count=0,sum=0;cin >> n;for (int i = 0; i < n; i++) {cin >> arry[i];sum += arry[i];}for (int i = 0; i < 2; i++) {cin >> locate[i];}//sort(arry, arry+n,cmp);if (sum<locate[0] * n || sum>locate[1] * n) {cout << -1;return 0;}for (int i = 0; i < n; i++) {if (arry[i] < locate[0]) {//在下界左边，需要增加add+= locate[0] - arry[i];}else if (arry[i] > locate[1]) {//在下界右边需要减少sub+= arry[i] - locate[1];}}count = max(add, sub);cout << count;}欢迎各位读者提出意见。
（菜菜奋斗小日记）
