Submission

Score: 0

User: sulinx

Problemset: laracroft

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-10 08:41:45

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

int main(){
    int n,w,tmp;
    cin >> n >> w;
    vector<int> price(n);
    for(int i = 0;i<n;i++){
        cin >> price[i];
    }
    
    vector<pair<int,int>> treasure;
    for(int i = 0;i<n;i++){
        cin >> tmp;
        auto p = make_pair(price[i],tmp);
        treasure.push_back(p);
    }sort(treasure.begin(),treasure.end(),greater<pair<int,int>>());

    int wn = 0,pn = 0;
    for(int i = 0;i<n;i++){
        if(treasure[i].second+wn<=w){
            wn += treasure[i].second;
            pn += treasure[i].first;
        }
    }
    cout << pn << ' ' << wn;
}