Submission #985640

#	Time	Username	Problem	Language	Result	Execution time	Memory
985640		AliHasanli	Topical (NOI23_topical)	C++17	33 / 100	598 ms	48316 KiB

Main

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,k,ans=0;
    cin>>n>>k;
    /*int r[n][k],u[n][k];
    for(int i=0;i<n;i++)
        for(int j=0;j<k;j++)
            cin>>r[i][j];
    for(int i=0;i<n;i++)
        for(int j=0;j<k;j++)
            cin>>u[i][j];
    for(int i=0;i<k;i++)
        if(r[0][i]>0)
            cout<<0,exit(0);
    cout<<1;*/
    vector<pair<long long,long long>>ru;
    long long r[n],u[n];
    for(int i=0;i<n;i++)cin>>r[i];
    for(int i=0;i<n;i++)cin>>u[i];
    for(int i=0;i<n;i++)
        ru.push_back({r[i],u[i]});
    sort(ru.begin(),ru.end());
    long long p=0;
    for(int i=0;i<n;i++)
    {
        if(ru[i].first<=p)
        {
            ans++;
            p+=ru[i].second;
            continue;
        }
        else break;
    }
    cout<<ans;
    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 28
• Subtask 3: 21 / 21
• Subtask 4: 0 / 39