华为oj中级 输入整型数组和排序标识，对其元素按照升序或降序进行排序

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<unordered_map>
#include<fstream>
#include<sstream>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<utility>
#include<iomanip>
using namespace std;
unsigned int num_day;
bool compare0(const unsigned int &a, const unsigned int &b){
    return a < b;
}
bool compare1(const unsigned int &a, const unsigned int &b){
    return a > b;
}
int main() {
    unsigned int n;
    int sort_flag;
    while (cin >> n){
        vector<unsigned int> v(n);
        for (int i = 0; i < n; i++)
            cin >> v[i];
        cin >> sort_flag;
        if (sort_flag == 0){
            sort(v.begin(), v.end(), compare0);
        }
        else{
            sort(v.begin(), v.end(), compare1);
        }
        for (int i = 0; i < v.size() - 1; i++)
            cout << v[i] << " ";
        cout << v[v.size() - 1] << endl;
    }

    return 0;
}