c# - Sorting by two columns with LINQ (Edited). Forget it! I'll post the answer to make things clear -

Hi my list that looks like this:

  val1 val2 r1 10 3 r2 5 5 r3 9 7 r4 4 r5 2 r6 1000 0  

I need to get the line in which the two values ​​meet with their maximum example:

< Pre> val1 val2 r1 10 3 can match any match both values ​​highe r2 5 5 any match can be more than two values ​​r3 9 7 MATCH val1 can be higher, but it lowers val2 and make viceversa r4 4 1 Both values ​​can be higher than r5 29 Any match val 2 your At the fourth, but val 1 can be more r6 1000 0 no match val1 is at its highest but val 2 could be higher

In this case it is R3

Hope this time it is clear

It is not clear what you are asking :

1) You do not want any pays that another pair is dominated by R.
2) You do not want items where val1 is maximum but val 2 can be high, and vice versa.

1 means that you want some pair on the upper edge of the set.
2 simply means that you abandon two endpoints

it still leaves any possible number

< / P>

In the graph above, 2 points are strictly dominated, and therefore you can declare them ineligible. There are two points which are satisfied (X is maximum but Y can increase, or vice versa) so you can disqualify them as well. He still satisfies the two points which satisfies (neither X and Y can grow without reducing anything else)

Actually (as Jason has also stated in the comment), his Considering basic data, (10,3) also satisfied (neither can be extended without reducing val1 and neither 2)