Greedy Validation and Proofs

Try adversarial instances: equal values, ties at boundaries, empty input.

Try this in Python

cases = [[], [1], [1, 1, 1], [9, 1, 9]]
print(len(cases))

Key takeaways

• Matroid intersection is beyond greedy—recognize when structure breaks.
• Brute small n to refute greedy hunches.
• Keep proof sketches in contest notebooks.