제출 #1338832

#제출 시각아이디문제언어결과실행 시간메모리
1338832AlphaBruhUiro (JOI25_uiro)C++20
30 / 100
5092 ms2168 KiB
#include<bits/stdc++.h>
using namespace std;
int n,q;
int a[200005],l,r;
priority_queue<int>pq;
void rexp(){
	while(pq.size()) pq.pop();
	int sum=0,ans=0;
	for(int i=l;i<=r;i++){
		if(sum>=a[i]){
			ans++;
			pq.push(a[i]);
			sum-=a[i];
			continue;
		}
		sum+=a[i];
		if(pq.empty()) continue;
		if(pq.top()>a[i]){
			sum+=((pq.top()-a[i])<<1);
			pq.pop();
			pq.push(a[i]);
		}
	}
	cout<<ans<<"\n";
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	cin>>q;
	while(q--){
		cin>>l>>r;
		rexp();
	}
}
#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...