Submission #20,595

20595

2026-01-07 18:41:58

cpp17

Wrong answer 22/40

65ms

1352 KiB

// UUID: 72c942bd-7bd7-47c0-bea8-e10cbf54d553
#include <bits/stdc++.h>
using namespace std;

int main() {
	int N; cin>>N;
	vector<pair<int, int>> V(N);
	for(int i=0; i<N; i++) cin>>V[i].first;
	for(int i=0; i<N; i++) cin>>V[i].second;
	sort(V.begin(), V.end());
	vector<int> prefix(N+1);
	prefix[1]=V[0].second;
	for(int i=1; i<N; i++) prefix[i+1]=prefix[i]+V[i].second;
	int ketpercesek=0;
	for(int i=N-1; i>=0; i--)
	{
		if(V[i].first>ketpercesek+prefix[i])
		{
			if(ketpercesek+prefix[i]+V[i].second>V[i].first)
			ketpercesek+=V[i].first-(ketpercesek+prefix[i]);
		}
	}
	cout<<ketpercesek+prefix[N];
}

	Sum	Test	Verdict		Time	Memory
base	22/40
		1	Accepted	0/0	2ms	316 KiB
		2	Accepted	0/0	13ms	568 KiB
		3	Accepted	2/2	1ms	508 KiB
		4	Wrong answer	0/2	1ms	316 KiB
		5	Wrong answer	0/2	10ms	496 KiB
		6	Wrong answer	0/2	21ms	652 KiB
		7	Wrong answer	0/2	3ms	428 KiB
		8	Wrong answer	0/2	4ms	332 KiB
		9	Accepted	3/3	1ms	316 KiB
		10	Accepted	3/3	1ms	316 KiB
		11	Accepted	3/3	1ms	316 KiB
		12	Accepted	3/3	1ms	316 KiB
		13	Accepted	4/4	2ms	316 KiB
		14	Accepted	4/4	1ms	508 KiB
		15	Wrong answer	0/2	37ms	800 KiB
		16	Wrong answer	0/2	50ms	1188 KiB
		17	Wrong answer	0/2	41ms	836 KiB
		18	Wrong answer	0/2	65ms	1352 KiB