bucketSort

#include <fstream>
#include <vector>
#include <algorithm>

std::vector<std::string> bucketSort(std::vector<std::string> &arr) {
    using namespace std;
    vector<vector<string>> bucket(74); // because I use table from 48 - 122 indices,
    // that's equal from letter 1 to letter z in lower case in ascii table
    vector<string> answer;

    for (auto elem : arr) {
        int index = ((int) elem[0]) - 48; // minus 48 because I use table from 48 to 122
        // that's equal '1' to 'z' in ascii
        bucket[index].push_back(elem);
    }

    for (int i = 0; i < bucket.size(); i++) {
        sort(bucket[i].begin(), bucket[i].end()); // sort our separated by first letter strings
    }

    for (int i = 0; i < bucket.size(); i++) { // add our sorted subarrs in one big
        if (!bucket[i].empty()) {
            for (int j = 0; j < bucket[i].size(); j++) {
                answer.push_back(bucket[i][j]);
            }
        }
    }
    return answer;
}

int main() {
    using namespace std;
    ifstream in("input.txt");
    ofstream out("output.txt");
    int count;
    in >> count;
    vector<string> toSort(count);

    for (int i = 0; i < count; i++){
        in >> toSort[i];
    }

    vector<string> answ = bucketSort(toSort);
    for (auto elem:answ) {
        out << elem << '\n';
    }
}