if they are not too long

why insert sort doesn't work?

i've found my mistake: never display 0 when the first row is 1

I have tried both bucket sort and segment tree based(nlogn) approaches, but seems both can not beat the time limit?

how to get the runtime to 0.015s?