Submission

Score: 0

User: qweqwe

Problemset: laracroft

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-25 14:23:15

#include <bits/stdc++.h>
#define speed cin.tie(0)->sync_with_stdio(0)
#define ll long long
#define pii pair<int,int>
using namespace std;

int main(){
	speed;
	int n,k;cin >> n >> k;
	vector<pii> invs(n);
	for (int i=0;i<n;i++){
		cin >> invs[i].first;
	}
	for (int i=0;i<n;i++){
		cin >> invs[i].second;
	}int sum=0,w=0;
	sort(invs.begin(),invs.end(),greater<pii>());
	for (pii i:invs){
		if (k<=0) break;
		if (i.second<=k){
			k-=i.second;
			w+=i.second;
			sum+=i.first;
		}//cout << sum << " " << w << "\n";
	}cout << sum << " " << w;
	return 0;
}