之前抄题解看题解做过 但现在重新写了一遍 发现WA了 代码如下

#include<bits/stdc++.h>
using namespace std;
struct node
{
	int ans;
}a[10005];
bool cmp (node x , node y)
{
	return x.ans < y.ans;
}
int main() 
{
	int n;
	cin >> n;
	int sum = 0;
	for(int i = 1;i <= n;i++)
	{
		cin >> a[i].ans;
		sum += a[i].ans;
	}
	int cnt = 0;
	int jun = sum / n;
	sort(a + 1 , a + n + 1, cmp);
	for(int i = 1;i <= n;i++)
	{
		if(a[i].ans == jun && n % 2 == 1)
		{
			cout << (n - 1) / 2;
			return 0;
		}
	}
	for(int i = 1;i <= n - 1;i++)
	{
		if(a[i].ans < jun)
		{
			int cha = jun - a[i].ans;
			a[i + 1].ans = a[i + 1].ans - cha;
			a[i].ans = jun;
			cnt++;
		}
	}
	cout << cnt;
	return 0;
}