------
## 最终结论
```python
def find_longest_word(s, d):
    def is_subsequence(word, s):
        it = iter(s)
        return all(char in it for char in word)

    longest_word = ""
    
    for word in d:
        if is_subsequence(word, s):
            if (len(word) > len(longest_word)) or (len(word) == len(longest_word) and word < longest_word):
                longest_word = word
                
    return longest_word
```