Submission #2194941

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int n,a[100009],r,minx=(1<<30);string S;
priority_queue<pair<int,int>,vector<pair<int,int>>,less<pair<int,int>>>Q;

int main(){
	cin>>n;
	for(int i=0;i<n;i++) cin>>a[i];
	cin>>S;
	for(int i=0;i<S.size();i++){
		if(S[i]=='m') {r=i;break;}
	}
	for(int i=0;i<=r;i++) Q.push(make_pair(a[i],i));
	minx=min(minx,Q.top().first);
	for(int i=r+1;i<n;i++){
		while(!Q.empty()){
			if(Q.top().second<i-r) Q.pop();
			else break;
		}
		Q.push(make_pair(a[i],i));
		minx=min(minx,Q.top().first);
	}
	cout<<minx<<endl;
	return 0;
}

Submission Info

Judge Result