c[1..n][1..m]                                  s[1..n][1..m]

 5  2  1  1  1  1  1  1  1  1  1  1  1  1 	1 1 1 0 0 0 0 0 0 0 0 0 0 0 
 x  8  4  4  4  4  4  4  4  4  4  4  4  4 	x 1 1 0 0 0 0 0 0 0 0 0 0 0 
 x  x 19  9  8  7  6  6  6  6  6  6  6  6 	x x 1 1 1 1 1 0 0 0 0 0 0 0 
 x  x  x 25 14 12 10  8  8  8  8  8  8  8 	x x x 1 1 1 1 1 0 0 0 0 0 0 
 x  x  x  x 35 23 20 13 11 11 11 11 11 11 	x x x x 1 1 1 1 1 0 0 0 0 0 
 x  x  x  x  x 53 40 32 19 12 12 12 12 12 	x x x x x 1 1 1 1 1 0 0 0 0 
 x  x  x  x  x  x 75 57 43 25 15 15 15 15 	x x x x x x 1 1 1 1 1 1 0 0 
 x  x  x  x  x  x  x 94 70 51 30 16 16 16 	x x x x x x x 1 1 1 1 1 0 0 

The optimal solution (with cost 16) is:
---------------------------------------
Pair skier 8 (height 67) with skis 12 (length 68)
Pair skier 7 (height 65) with skis 11 (length 62)
Pair skier 6 (height 60) with skis 10 (length 59)
Pair skier 5 (height 51) with skis 9 (length 54)
Pair skier 4 (height 46) with skis 8 (length 48)
Pair skier 3 (height 45) with skis 7 (length 43)
Pair skier 2 (height 36) with skis 3 (length 34)
Pair skier 1 (height 35) with skis 2 (length 33)