C++排序代码1（自己写的）

#include<bits/stdc++.h>
using namespace std;
int main()
{
        queue<int> b[10];
	int a[10001],l;
	cin>>l;
	for(int i = 0;i<l;i++)
	{
		cin>>a[i];
	}
	bool yes = false;
	for(int temp = 10;!yes;temp*=10)
	{
		yes = true;
		for(int i = 0;i<l;i++)
		{
			int t = a[i]%temp/(temp/10);
			switch (t)
			{
				case 0:
					b[0].push(a[i]);
					break;
				case 1:
					b[1].push(a[i]);
					yes = false;
					break;
				case 2:
					b[2].push(a[i]);
					yes = false;
					break;
				case 3:
					b[3].push(a[i]);
					yes = false;
					break;
				case 4:
					b[4].push(a[i]);
					yes = false;
					break;
				case 5:
					b[5].push(a[i]);
					yes = false;
					break;
				case 6:
					b[6].push(a[i]);
					yes = false;
					break;
				case 7:
					b[7].push(a[i]);
					yes = false;
					break;
				case 8:
					b[8].push(a[i]);
					yes = false;
					break;
				case 9:
					b[9].push(a[i]);
					yes = false;
					break;
			}
		}
		int tt = 0;
		for(int i = 9;i>=0;i--)
		{
			while(!b[i].empty())
			{
				a[tt++] = b[i].front();
				b[i].pop();
			}
		}
	}
	for(int i = 0;i<l;i++)
	{
		cout<<a[i]<<"\n";
	}
	return 0;
}

乱写的。。