// lane av1_1016_1001b : WA HARNESS-COST PROBE. sort() is a no-op, so the board's
// reported time is (judge's own main) + (its verifier reaching its first inversion).
// Paired with y_nosr.cpp (L2 pass only, same verifier outcome) the DIFFERENCE is the
// L2 pass, because both arms leave `a` equally unsorted.
void sort(unsigned *a,int n){ (void)a; (void)n; }