Longest Subsequence Repeated k Times

Given a string s and an integer k, return the longest subsequence of s such that it is repeated k times. If multiple answers exist, return the lexicographically smallest one. If there is no such subsequence, return an empty string.