cses.cpp

#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main() {
    ll t;
    cin >> t;
    while (t--) {
        ll x;
        cin >> x;

        vector<ll> v(x);
        for (int i = 0; i < x; i++) {
            cin >> v[i];
        }

        vector<ll> v1(x);
        for (int i = 0; i < x; i++) {
            cin >> v1[i];
        }

        map<ll, vector<ll>> store;
        for (int i = 0; i < x; i++) {
            store[v[i]].push_back(v1[i]);
        }

      
        for (auto &entry : store) {
            sort(entry.second.begin(), entry.second.end(), greater<ll>());
        }

       
        vector<pair<ll, vector<ll>>> sortedStore(store.begin(), store.end());
        sort(sortedStore.begin(), sortedStore.end(), [](const auto &a, const auto &b) {
            return a.second.size() > b.second.size();
        });

       
        for (auto &entry : sortedStore) {
            for (int j = 1; j < entry.second.size(); j++) {
                entry.second[j] += entry.second[j - 1];
            }
        }

        for (int k = 1; k <= x; k++) {
            ll ans = 0;
            for (auto &entry : sortedStore) {
                if (entry.second.size() < k) {
                    break;
                }
                ll val = entry.second.size() / k; 
                val *= k;                         
                ans += entry.second[val - 1];    
            }
            cout << ans << " ";
        }
        cout << endl; 
    }
    return 0;
}