154392025-02-19 16:13:10feheristvanÓvodacpp17Wrong answer 4/50105ms3636 KiB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Gyerek {
    int akar_szerep; // preferred role
    int siras;      // crying level
    int index;      // original index
};

struct Szerep {
    int db;        // available roles
    int index;     // original index
    int mdb;       // maximum roles (not used in this implementation)
};

bool comp(const Gyerek &a, const Gyerek &b) {
    return a.siras < b.siras; // Sort by crying level
}

int main() {
    int n, m;
    cin >> n >> m;

    vector<Gyerek> gyerekek(n);
    vector<Szerep> szerepek(m);

    for (int i = 0; i < m; i++) {
        cin >> szerepek[i].db; // Read available roles
        szerepek[i].mdb = szerepek[i].db; // Store maximum roles (not used)
        szerepek[i].index = i; // Store original index
    }

    for (int i = 0; i < n; i++) {
        cin >> gyerekek[i].akar_szerep; // Read preferred role
        gyerekek[i].akar_szerep--; // Adjust for 0-based indexing
        gyerekek[i].index = i; // Store original index
    }

    for (int i = 0; i < n; i++) {
        cin >> gyerekek[i].siras; // Read crying level
    }

    sort(gyerekek.begin(), gyerekek.end(), comp); // Sort children by crying level

    vector<int> kapott_szerep(n, -1); // Store assigned roles
    int total_siras = 0; // Total crying level

    for (int i = 0; i < n; i++) {
        int preferred_role = gyerekek[i].akar_szerep;

        // Try to assign the preferred role
        if (szerepek[preferred_role].db > 0) {
            szerepek[preferred_role].db--;
            kapott_szerep[gyerekek[i].index] = szerepek[preferred_role].index; // Assign role
        } else {
            // If preferred role is not available, try to find any available role
            bool assigned = false;
            for (int j = 0; j < m; j++) {
                if (szerepek[j].db > 0) {
                    szerepek[j].db--;
                    kapott_szerep[gyerekek[i].index] = szerepek[j].index; // Assign available role
                    assigned = true;
                    break;
                }
            }
            // If no role is assigned, increase the crying level
            if (!assigned) {
                kapott_szerep[gyerekek[i].index] = -1; // No role available
                total_siras += gyerekek[i].siras; // Count crying level
            }
        }
    }

    cout << total_siras << endl; // Output total crying level
    for (int i : kapott_szerep) {
        cout << (i + 1) << " "; // Convert back to 1-based indexing
    }
    cout << endl;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base4/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/04ms316 KiB
3Wrong answer0/21ms512 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Accepted2/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms332 KiB
9Accepted2/21ms316 KiB
10Wrong answer0/21ms316 KiB
11Wrong answer0/21ms316 KiB
12Wrong answer0/21ms316 KiB
13Wrong answer0/22ms508 KiB
14Wrong answer0/32ms316 KiB
15Wrong answer0/313ms756 KiB
16Wrong answer0/363ms1076 KiB
17Wrong answer0/339ms1332 KiB
18Wrong answer0/361ms2188 KiB
19Wrong answer0/371ms1968 KiB
20Wrong answer0/381ms2092 KiB
21Wrong answer0/398ms2536 KiB
22Wrong answer0/4105ms3636 KiB