黃宇綸

1. #include<bits/stdc++.h>
   
2. using namespace std;
   
3. #define ll long long
   
4. #define int ll
   
5. #define FOR(i,a,b) for(int i=a;i<b;i++)
   
6. #define REP(i,n) FOR(i,0,n)
   
7. #define REP1(i,n) FOR(i,1,(n)+1)
   
8. #define RREP(i,n) for(int i=(n)-1;i>=0;i--)
   
9. #define f first
   
10. #define s second
    
11. #define pb push_back
    
12. #define ALL(x) x.begin(),x.end()
    
13. #define SZ(x) (int)(x.size())
    
14. #define SQ(x) (x)*(x)
    
15. #define pii pair<int,int>
    
16. #define Graph vector<vector<int>>
    
17. #define IOS() cin.sync_with_stdio(0),cin.tie(0),cout.tie(0)
    
18. const ll inf=(1ll<<63)-1;
    
19. const int maxn=1e5+5;
    
20. const ll mod=1e9+7;
    
21. vector<int> v={5,7,3,9,8,1,2};
    
22. bool so(int a,int b) { return a>b; }
    
23. signed main()
    
24. {
    
25.     IOS();
    
26.     int n=SZ(v);
    
27.     sort(ALL(v));
    
28.     REP(i,n) cout<<v[i]<<" "; cout<<"\n";
    
29.     sort(ALL(v),so);
    
30.     //sort(v.rbegin(),v.rend());
    
31.     REP(i,n) cout<<v[i]<<" "; cout<<"\n";
    
32.     return 0;
    
33. }

複製代碼