How does a greedy solution perform in terms of approximation? In our recent paper Approximation by lexicographically maximal solutions in matching and matroid intersection problems, we study how good a lexicographically maximal solution is in the weighted matching and matroid intersection problems. A solution is lexicographically maximal if it takes as many heaviest elements as possible, and subject to this, it takes as many second heaviest elements as possible, and so on. Clearly, if the distinct weight values are sufficiently dispersed, e.g., the minimum ratio of two distinct weight values is at least the ground set size, then lexicographical maximality and weighted optimality are equivalent. We show that the threshold of the ratio for this equivalence to hold is in fact exactly 2. Furthermore, we prove that if the ratio is less than 2, say α, then a lexicographically maximal solution achieves (α/2)-approximation, and this bound is tight.