Think about a simpler version of this problem. For example, show that at least 3 numbers from any ordering of 5 different numbers are in ascending or descending order.
Here's one way to prove the simpler statement above. Consider the first three numbers in the set of five. If those three are in ascending or descending order, the statement is correct in this case. If the first three numbers are not in ascending or descending order, we must have an arrangement similar to one of the following:
Now suppose the fourth number is larger than the fifth (x > y). Let's compare the fourth number to the largest of the first three (call this w):
Follow a similar chain of reasoning to show that at least three numbers in the set are arranged in ascending or descending order if x < y.