Submission

Status:

[PPP-SSSSSSSSSSS]

Subtask/Task Score:

{0/100}

Score: 0

User: nik121416

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-18 14:07:04

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

#define ll long long
vector<ll> sum(2001,0);

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,m;
    cin >> n >> m;
    vector<ll> value(n);
    vector<ll> weigth(n);
    for(int i = 0 ; i < n;i++){
        cin >> value[i];
    }
    for(int i = 0 ; i < n;i++){
        cin >> weigth[i];
    }
    
    for(int i = 0 ; i < n;i++){
        sum[weigth[i]] = value[i];
    }
    for(int i = 0 ;i < n;i++){
        for(int j = i ; j < n;j++){
            ll a = value[i] + value[j];
            ll b = weigth[i] + weigth[j];
            if(b > m) continue;
            else if(a > sum[b]){
                sum[b] = a;
            }
        }
    }
    ll mx = INT_MIN;
    for(int i = 0; i <= m;i++){
        if(sum[i] > mx) mx = sum[i];
    }
    int idx;
    for(int i = 0 ; i <= m;i++){
        if(sum[i] == mx){
            idx = i;
            break;
        }
    }
    if(mx == 0){
        cout << "0 0";
    }
    else{
        cout << mx << ' ' << idx;
    }
}