204312026-01-06 18:19:23algoproBányász RPG (40 pont)cpp17Wrong answer 15/4065ms1076 KiB
// UUID: 2708cc5a-e610-42d7-92db-238f56d31b43
#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)*2;
			time+=(anyagok[i].second-(anyagok[i].first-xp));
			xp+=anyagok[i].second;
		}
		else{xp+=anyagok[i].second;
			time+=anyagok[i].second*2;}
	}
	cout<<time;
}
SubtaskSumTestVerdictTimeMemory
base15/40
1Wrong answer0/01ms316 KiB
2Wrong answer0/013ms316 KiB
3Accepted2/22ms316 KiB
4Accepted2/22ms316 KiB
5Accepted2/210ms508 KiB
6Accepted2/220ms564 KiB
7Accepted2/23ms316 KiB
8Accepted2/24ms500 KiB
9Accepted3/31ms508 KiB
10Wrong answer0/31ms316 KiB
11Wrong answer0/31ms316 KiB
12Wrong answer0/32ms324 KiB
13Wrong answer0/41ms316 KiB
14Wrong answer0/41ms316 KiB
15Wrong answer0/237ms564 KiB
16Wrong answer0/250ms824 KiB
17Wrong answer0/241ms844 KiB
18Wrong answer0/265ms1076 KiB