You are a choreographer putting together a dance number where the dancers will dance in pairs. Each dancer has a height hi and you can only pair up dancers if the difference between their heights is at most H. You wish, given this constraint, to find the maximal number of suitable pairs. Describe and analyze a greedy strategy for this problem.