Minimum Adjacent Swaps to Reach the Kth Smallest Number

You are given a number num in string format and an integer k.
Consider all permutations of the digits of num that are greater than num.
Among those, we are only interested in the k-th smallest permutation based on numerical order.

Once we determine that k-th smallest permutation, you must convert the original number num into that permutation, but you are only allowed to swap two adjacent digits at a time.

Your task is to return the minimum number of adjacent swaps required to transform num into the k-th smallest greater permutation.

It is guaranteed that the k-th permutation exists.