233332026-01-19 17:55:06algoproBányász RPG (40 pont)cpp17Accepted 40/4028ms1588 KiB
// UUID: 7549ce61-2e4e-4b35-ad24-726909d5e4b4
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
#define srt(x) x.begin(),x.end()
const int INF = 1e9 + 7;

signed main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);
	int n; cin >> n;
	vector<pii>a(n);
	for(int i = 0; i < n; i++) cin >> a[i].F;
	for(int i = 0; i < n; i++) cin >> a[i].S;
	sort(srt(a));
	int lvl = 0, ans = 0;
	int l = 0, r = n-1;
	while(l <= r)
	{
		if(a[l].F <= lvl)
		{
			lvl += a[l].S;
			ans += a[l].S;
			l++;
		}
		else
		{
			lvl++;
			ans += 2;
			a[r].S--;
			if(a[r].S == 0) r--;
		}
	}
	cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms320 KiB
2Accepted0/06ms564 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/24ms564 KiB
6Accepted2/29ms820 KiB
7Accepted2/22ms332 KiB
8Accepted2/22ms508 KiB
9Accepted3/31ms376 KiB
10Accepted3/31ms532 KiB
11Accepted3/31ms316 KiB
12Accepted3/31ms320 KiB
13Accepted4/41ms500 KiB
14Accepted4/41ms316 KiB
15Accepted2/217ms1076 KiB
16Accepted2/221ms1332 KiB
17Accepted2/217ms1076 KiB
18Accepted2/228ms1588 KiB