11462 - Age Sort - UVA

#include<cstdio>
#include<map>
#define foreach(it, l) for (typeof(l.begin()) it = l.begin(); it != l.end(); it++)
using namespace std;
int main() {
	int n, leido, cant;
	map mapa;
	while(scanf("%d", &n)) {
		if(n == 0) break;
		mapa.clear();
		for (int i = 0; i < n; i++) {
			scanf("%d", &leido);
			mapa[leido]++;
		}
		bool first = true;
		foreach(it, mapa) {
			cant = it->second;
			for (int i = 0; i < cant; i++)
				if(first) printf("%d", it->first), first = false;
				else printf(" %d", it->first);
		}
		printf("\n");
	}
	return 0;
}