why is ee not in the first place when he is having the most number of coins which is 11 coins?

Question

arr = {"a": 2,"b": 3,"k": 10,"c": 4,"j": 9,"d": 5,"ee": 11,"f": 6,"g": 7,"h": 8}

abb = ["a","j","ee","b","c","d","k","g","f","h"]
for i in abb:
for q in arr:
if i == q:
print(max(abb))
abb.remove(max(abb))
print(max(abb))
abb.remove(max(abb))
print(max(abb))
abb.remove(max(abb))
print(max(abb))
abb.remove(max(abb))
print(max(abb))
abb.remove(max(abb))

"""
the government is holding a low-cost housing program because the funds are borne by donors. But because there are so many low-cost house enthusiasts, the government wants to sort out who is the first and who is the last to get a low-cost house. Sorted by who gave the most coins then he became the first order

output:
k
j
h
g
f
ee
d
c
b
a

May Allah bless you if you can solve this problem.

Answer 1

You may sort the arr first, and max(abb) may be max(arr.values()) ?

# sort by dict's value and reverse it
arr = sorted(arr.items(), key=lambda x: x[1], reverse=True)

That your code looks like:
arr = {"a": 2,"b": 3,"k": 10,"c": 4,"j": 9,"d": 5,"ee": 11,"f": 6,"g": 7,"h": 8}
abb = ["a","j","ee","b","c","d","k","g","f","h"]
arr = sorted(arr.items(), key=lambda x:x[1], reverse=True)
for k, v in arr:
if k in abb:
# print(k, v)
print(k)

Answer 2

I tried my own way jaja

abb = {"a": 2,"b": 3,"k": 10,"c": 4,"j": 9,"d": 5,"ee": 11,"f": 6,"g": 7,"h": 8}
for _ in range(len(abb)):
e = list(abb.keys())[list(abb.values()).index(max(abb.values()))]
print(e)
abb.pop(e)

Answer 3

I'm not a scientist, but it looks like reverse alphabetical order...

Answer 4

Good job fan yu, may Allah bless you with a great blessing, aameen

Answer 5

Ok, Cristian Gabriel Mazzulla, your code also working well so may Allah bless you with a great blessing, aameen