A了2个点，T了3个点，求dalao改错

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdio> 
const int MAXN = 100005;
int n;
int num[MAXN];
inline void read(int &x)
{
    char ch = getchar(),c = ch;x = 0;
    while(ch < '0' || ch > '9') c = ch,ch = getchar();
    while(ch <= '9' && ch >= '0') x = (x<<1)+(x<<3)+ch-'0',ch = getchar();
    if(c == '-') x = -x;
}
inline void swap(int &a,int &b)
{
    int tmp = a;
    a = b;
    b = tmp;
}
void q_sort(int l,int r)
{
    int i = l,j = r;
    if(i >= r)
        return;
    int tmp = num[l];
    while(i < j)
    {
        while(num[j] >= tmp && i < j)
            j --;
        while(num[i] <= tmp && i < j)
            i ++;
        if(i < j) swap(num[i],num[j]);
    }
    if(num[l] > num[i]) swap(num[l],num[i]);
    q_sort(l,i);
    q_sort(i+1,r);
}
int main()
{
    read(n);
    for(int i = 1;i <= n;++ i)
        read(num[i]);
    q_sort(1,n);
    for(int i = 1;i <= n;++ i)
        printf("%d ",num[i]);
    puts("");
    return 0;
}