string s; while (getline(cin, s)) { int ret=0; int n = s.size(); sort(s.begin(), s.end()); int cnt = 0; priority_queue<int, vector<int>, greater<int> > heap; for (int i = 0, j; i < n;) { j = i; while (j < n && s[j] == s[i]) ++j; hea...