/*
 * @lc app=leetcode.cn id=1081 lang=cpp
 *
 * [1081] 不同字符的最小子序列
 */

// @lc code=start
class Solution {
public:
    string smallestSubsequence(string s) {
        vector<int> vis(26), num(26);
        for (char c : s) {
            num[c - 'a']++;
        }
        string stk;
        for (char c : s) {
            if (!vis[c - 'a']) {
                while (!stk.empty() && stk.back() > c) {
                    if (num[stk.back() - 'a'] > 0) {
                        vis[stk.back() - 'a'] = 0;
                        stk.pop_back();
                    } else {
                        break;
                    }
                }
                vis[c - 'a'] = 1;
                stk.push_back(c);
            }
            num[c - 'a'] -= 1;
        }
        return stk;
    }
};
// @lc code=end