Need some hints on this heap-related algorithm design question

Question

I meet this problem when practicing algorithm. The problem is like this: There is a street with n shops. All the shops have one and only one kind of item, a