204292026-01-06 18:17:16algoproBányász RPG (40 pont)cpp17Wrong answer 0/4064ms1076 KiB
// UUID: ffe0e079-84dd-43cd-8859-09d250b0be8e
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin>>n;
	int time=0;
	vector<pair<int,int>>anyagok(n);
	for(int i=0;i<n;i++){
		cin>>anyagok[i].first;
	}
	for(int i=0;i<n;i++){
		cin>>anyagok[i].second;
	}
	sort(anyagok.rbegin(),anyagok.rend());
	int xp=0;
	for(int i=0;i<n;i++){
		if(xp>=anyagok[i].first){
			xp+=anyagok[i].second;
			time+=anyagok[i].second;
		}
		else if(xp+anyagok[i].second>=anyagok[i].first){
			time+=anyagok[i].first-xp;
			time+=2*(anyagok[i].second-(anyagok[i].first-xp));
			xp+=anyagok[i].second;
		}
		else{xp+=anyagok[i].second;
			time+=anyagok[i].second*2;}
	}
	cout<<time;
}
SubtaskSumTestVerdictTimeMemory
base0/40
1Accepted0/01ms316 KiB
2Wrong answer0/012ms508 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms512 KiB
5Wrong answer0/210ms496 KiB
6Wrong answer0/221ms564 KiB
7Wrong answer0/23ms316 KiB
8Wrong answer0/24ms500 KiB
9Wrong answer0/31ms316 KiB
10Wrong answer0/31ms316 KiB
11Wrong answer0/31ms316 KiB
12Wrong answer0/31ms316 KiB
13Wrong answer0/41ms500 KiB
14Wrong answer0/41ms316 KiB
15Wrong answer0/237ms808 KiB
16Wrong answer0/250ms932 KiB
17Wrong answer0/241ms820 KiB
18Wrong answer0/264ms1076 KiB