A post-riddle or probability theory is dedicated

The algorithm for the optimal choice of a girl for a joint New Year.

Suppose you came to a party or club to celebrate the New Year. Naturally there will be girls without a couple. You want to get to know each other. Suppose, according to statistics, the most beautiful girl will refuse with a probability of 50%. Each less attractive one will say “yes” with a greater probability of + 5% from the previous one.
Moreover, the refusal of each girl reduces the probability of the next by -5%, and consent - on the contrary, + 5%.
Task - calculate the algorithm so that for the minimum number of iterations get to know the cutest girl.

1. We are trying to meet the most beautiful girl.
2. If she said yes, then we complete the task.
3. If you said no, then we’ll go to another party / club. And go to the 1st point.

Moral - on New Year's Eve it is better to forget about probability theory :)