1
class Solution {
2
 public:
3
  string getSmallestString(int n, int k) {
4
    string str = "";
5
    for (int i = 0; i < n; i++) {
6
      str += 'a';
7
    }
8
    int curr = n;
9
    int diff = k - curr;
10
    if (diff == 0) return str;
11
    for (int i = n - 1; i >= 0 && diff > 0; i--) {
12
      if (diff > 25) {
13
        str[i] = 'z';
14
        diff -= 25;
15
      } else {
16
        str[i] = char('a' + diff);
17
        return str;
18
      }
19
    }
20
    return str;
21
  }
22
};
23
// a a a a a
24
// 5
25
// diff= 73-5
26
//