95pts且1TLE求调

#include <bits/stdc++.h>

using namespace std;

int cut;
int main(){
    int n;
    cin >> n;
    int a[n];
    for(int i = 0;i < n;i++){
        cin >> a[i];
    }
    bool flag = true;
    for(int i = 0;i < n;i++){
        if(a[i] != 0){
            flag = false;
            break;
        }
    }
    if(flag){
        cout << "0" << endl;
        return 0;
    }
    while(!flag){
        int maxx = a[0];
        int maxx_xb = 0;
        int minn = a[0];
        int minn_xb = 0;
        for(int i = 1;i < n;i++){       // 找最大值
            if(a[i] >= maxx){
                maxx = a[i];
                maxx_xb = i;
            }
        }
        for(int i = 1;i < n;i++){       // 找最小值
            if(a[i] <= minn && a[i] != 0){
                minn = a[i];
                minn_xb = i;
            }
        }
        a[maxx_xb] -= a[minn_xb];
    
        bool temp = true;
        for(int j = 0;j < n;j++){
            if(a[j] != 0){
                temp = false;
                break;
            }
        }
        if(temp){
            flag = true;
        }
        cut += 1;
    }
    cout << cut << endl;
    return 0;
}