1 条题解

  • 0
    @ 2026-3-7 21:58:59

    C++ :

    #include <algorithm>
    #include <cstdio>
    using namespace std;
    const int N = 105;
    int n;
    int a[N];
    int cnt;
    int main() {
    	scanf("%d", &n);
    	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    	while (1) {
    	int mx = n;
    	for (int i = 1; i <= n; i++)
    	if (a[i] >= a[mx]) mx = i;
    	if (a[mx] == 0) break;
    	int mn = a[mx];
    	for (int i = 1; i <= n; i++)
    	if (a[i] > 0) mn = min(mn, a[i]);
    	a[mx] -= mn;
    	cnt++;
    	}
    	printf("%d\n", cnt);
    	return 0;
    }
    

    信息

    ID
    1901
    时间
    1000ms
    内存
    128MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者