제출 #1170861

#제출 시각아이디문제언어결과실행 시간메모리
1170861jellybeanGift Exchange (JOI24_ho_t4)C++20
0 / 100
2594 ms6668 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define dd(x) cout<<#x<<" is "<<x<<endl;

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n; cin>>n;
	int a[n],b[n];
	for(int i=0; i<n; i++) cin>>a[i];
	for(int i=0; i<n; i++) cin>>b[i];
	int q; cin>>q;
	while(q--){
		int l,r; cin>>l>>r;
		//multiset<int>s
		bool f=0;int sum=0, s1=0;
		for(int i=l-1; i<r; i++){
			s1 += a[i];
			multiset<int>s;
			for(int j=l-1; j<r; j++) if(i!=j) s.insert(a[j]);
			auto it = s.lower_bound(b[i]);
			if(it == s.end()){f=1;}
			else sum += *it;
		}
		if(sum >s1) f=1;
		//dd(sum) dd(s1)
		if(f) cout<<"No\n";
		else cout<<"Yes\n";
	}
		
	
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...