暴力解法

纯暴力，暴力解决一切

#include<bits/stdc++.h>
using namespace std;
const int N = 110;
int n;
int a[N];
int ans = 0;
 
int main(){
	cin >> n;
	for(int i = 1;i <= n;i++){
		cin >> 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(a[i],mn);
		}
		a[mx] -= mn;
		ans++;
	}
	cout << ans;
	return 0;
}

O(10的六次方)