I've got a list like following:
{{{x1,y1,1}, {x2,y2,1}, {x3,y3,1}, {x4,y4,1}, {x5,y5,1}}
{{x6,y6,2}, {x7,y7,2}, {x8,y8,2}, {x9,y9,2}, {x10,y10,2}}
{{x11,y11,3}, {x12,y12,3}, {x13,y13,3}, {x14,y14,3}, {x15,y15,3}}}
What I want to do:
Choose out of every row the triplet with the highest x value. Then, out of these triplets, choose the one with the lowest x value.
Grid
to initialize lists, see bullet point 6 here. $\endgroup${x,y,z}
wherey
is actuallyx
...) Are you just looking for the triplet with the most negative value ofz
? $\endgroup$