大佬们，我用快排做为什么TLE啊！``` #include

using namespace std;

const int N = 2000010; int a[N];

void quick_sort(int a[], int l, int r) { if (l >= r) return;

int x = a[(l + r) / 2];
int i = l, j = r;
while (i < j)
{
	while (i < j && a[i] < x) i++;
	while (i < j && a[j] > x) j--;
	if (i < j) swap(a[i], a[j]);
}

quick_sort(a, l, i - 1);
quick_sort(a, i + 1, r);

} int main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) cin >> a[i]; quick_sort(a, 0, m - 1);

for (int i = 0; i < m; i++)
	cout << a[i] << " ";

return 0;

}