sos cần ngay và luôn

//tăng

#include <bits/stdc++.h>
#define SmileHappy  int main()
#define ll long long
#define str string
#define fir first
#define sec second
#define ld long double
#define pb push_back
#define MOD 100000009
#define freopen(name) if(fopen(name".INP","r")) {freopen (name".INP","r",stdin); freopen (name".OUT","w",stdout);}
#define ALL(x) (x).begin(),(x).end()
using namespace std;
SmileHappy {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (a[i] > a[j]) {
        swap(a[i], a[j]);
      }
    }
  }
  for (int i = 0; i < n; i++)
    cout << a[i] << " ";
  cout << endl;
  return 0;
}

//giảm

#include <bits/stdc++.h>
#define SmileHappy  int main()
#define ll long long
#define str string
#define fir first
#define sec second
#define ld long double
#define pb push_back
#define MOD 100000009
#define freopen(name) if(fopen(name".INP","r")) {freopen (name".INP","r",stdin); freopen (name".OUT","w",stdout);}
#define ALL(x) (x).begin(),(x).end()
using namespace std;
SmileHappy {
int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (a[i] < a[j]) {
        swap(a[i], a[j]);
      }
    }
  }
  for (int i = 0; i < n; i++)
    cout << a[i] << " ";
  cout << endl;
  return 0;
}

code tăng dần

#include<bits/stdc++.h>
using namespace std;
long long n,i,a[1000005];
int main(){
    cin>>n;
    for (i=1; i<=n; i++)
        cin>>a[i];
    sort (a+1,a+n+1);
    for (i=1; i<=n; i++)
        cout<<a[i]<<" ";
}

code giảm dần

#include<bits/stdc++.h>
using namespace std;
long long n,i,a[1000005];
int main(){
    cin>>n;
    for (i=1; i<=n; i++)
        cin>>a[i];
    sort (a+1,a+n+1, greater<long long>());
    for (i=1; i<=n; i++)
        cout<<a[i]<<" ";
}