On the sum-of-ranks winner when losers are removed

Suppose that m alternatives are linearly ranked from best to worst by each of a number of judges, and that alternative x is the unique winner on the sum-of-ranks basis. It is shown that it is possible to construct a situation (with an appropriate number of judges) such that the initial winner x will be a sum-of-ranks loser within every proper subset of the original set of alternatives that contains x and at least one other alternative, except that x is the winner in exactly one subset that contains x and one other alternative.