227472026-01-15 17:42:55szjÓvodacpp17Wrong answer 21/5050ms2868 KiB
#include<bits/stdc++.h>
using namespace std;
struct kolyok
{
    int pulyanr, boges, valasz;
};
bool f(kolyok a, kolyok b)
{
    return a.boges > b.boges;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    long long int n, m, i, siras=0, j=0;
    cin >> n >> m;
    int szerep[m];
    vector<int> kiva(n, -1);
    kolyok t[n];
    for(i=0; i<m; i++)cin >> szerep[i];
    for(i=0; i<n; i++)
    {
        cin >> t[i].valasz;
        t[i].valasz--;
        t[i].pulyanr=i;
    }
    for(i=0; i<n; i++)cin >> t[i].boges;
    sort(t, t+n, f);
    for(i=0; i<n; i++)
    {
        if(szerep[t[i].valasz]>0)
        {
            kiva[t[i].pulyanr]=t[i].valasz;
            szerep[t[i].valasz]--;
        }
    }
    for(i=0; i<n; i++)
    {
        for(j; j<m && szerep[j]==0; j++);
        if(kiva[t[i].pulyanr]==-1)
        {
            siras+=t[i].boges;
            kiva[t[i].pulyanr]=j;
        }
    }
    cout << siras << endl;
    for(i=0; i<n; i++)cout << kiva[i]+1 << " ";
}
SubtaskSumTestVerdictTimeMemory
base21/50
1Accepted0/01ms316 KiB
2Wrong answer0/03ms508 KiB
3Accepted2/21ms316 KiB
4Partially correct1/21ms508 KiB
5Partially correct1/21ms316 KiB
6Accepted2/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Partially correct1/21ms536 KiB
9Accepted2/21ms500 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms316 KiB
12Partially correct1/21ms316 KiB
13Wrong answer0/21ms316 KiB
14Partially correct1/31ms432 KiB
15Wrong answer0/37ms748 KiB
16Wrong answer0/314ms840 KiB
17Accepted3/320ms1176 KiB
18Wrong answer0/330ms1824 KiB
19Partially correct1/335ms2032 KiB
20Partially correct1/343ms2072 KiB
21Partially correct1/346ms2312 KiB
22Wrong answer0/450ms2868 KiB