Minimum item by key in nested lists

1

Dear Dynamers,
I have two nested lists which are identical in size and format but with different items at each index. I want two get the shortest of each couple of indices at Level 2. But unfortunately the list minimum by key get one list and I cannot figure out a way to make it compare the proper indices.
I assume it needs python (as always…) but I don’t know how to write it.

image
image1920×1080 306 KB

2

Hi,
Sorry, I on’t understand very well.
Can you explain me better, you have 2 nested list of what elements (lines?)? For what output are you looking for?

3

LIST 1
0 List
line 1
line 2
1 List

LIST 2

4

Mistake… posting again

5

Yes it’s lines and I want to compare them basd on their length

image
image1152×2048 181 KB

6

To give you a little better understanding this is what I’m doing. 2 Lists of 20 lines each but instead of 40 lines after the comparison I would like to get the shortest 20 by comparing in pairs according to their index.

image
image1920×1080 426 KB

7

Try @L3 instead of 1 or 2.

8

Doesn’t help. I also tried all lacing options.

image
image1920×1080 428 KB

9

You can try this:

image
image1755×507 37.4 KB

10

Thanks a lot for the reply. But the graph you are suggesting gives me the 10 shortest lines from each list. Let me try to explain a little more the concept.

image
image1920×1080 332 KB

I have a room of 20 people. The people will leave from the closest door. For each one correspond two lines connecting them with each of the doors. By finding which of the two lines of each person is shortest I get which door they will leave from.

11

@D.CHRISTIDIS See if this works for you …

doors
doors1250×848 80.8 KB

12

So much smoother. Thanks a lot Vikram_Guru