Пробвах доста различни начини, но в Judge не мога да мина повече от 64/100. Наясно съм, че задачата може да се решава със стек и опашка, но искам да го направя с лист, защото според мен е по-просто. Моля ви, някой да ми подскаже, защото нямам идея какво не е наред.

https://pastebin.com/896bVHqu

Ето и условието:

1.Meeting

Link: https://judge.softuni.org/Contests/Practice/Index/3251#0

The first line will give you a sequence of integers representing males. Afterward, you will be given another sequence of integers representing females.

You have to start from the first female and try to match it with the last male.

• If their values are equal, you have to match them and remove both of them. Otherwise, you should remove only the female and decrease the value of the male by 2.
• If someone’s value is equal to or below 0, you should remove him/her from the records before trying to match him/her with anybody.
• Special case - if someone’s value is divisible by 25 without remainder, you should remove him/her and the next person of the same gender.

You need to stop matching people when you have no more females or males.

Input / Constraints

• On the first line, you will receive the integers, representing the males, separated by a single space.
• On the second line, you will receive the integers, representing the females, separated by a single space.
• All of the given numbers will be valid integers in the range [-100, 100].

Output

• On the first line - print the number of successful matches:
  • "Matches: {matchesCount}"
• On the second line - print all males left:
  • If there are no males: "Males left: none"
  • If there are males: "Males left: {male1}, {male2}, {male3}, (…)"
• On the third line - print all females left:
  • If there are no females: "Females left: none"
  • If there are females: "Females left: {female1}, {female2}, {female3}, (…)"

Examples