【数组】升序降序数组

#include <iostream>
#include <algorithm>
using namespace std;
bool cmp1(int a,int b){
    return (a<b);
}
bool cmp2(int a,int b){
    return (a>b);
}
int main(){
    int num = 0;
    int flag = 0;
    while(cin>>num){
        int num_Array[num] = {0};
        for(int i = 0;i<num;i++){
            cin>>num_Array[i];
        }
        cin>>flag;
        if(flag==0){
            sort(num_Array,num_Array+num,cmp1);
        }
        else{
            sort(num_Array,num_Array+num,cmp2);
        }
        for(int i = 0;i<num;i++){
            cout<<num_Array[i];
            cout<<' ';
        }
        cout<<endl;
    }
}