Submission #997886

---

Source Code Expand

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

int main(){
	int n;
	cin >> n;
	int p[n];
	for(int i = 0; i < n; i++) cin >> p[i];
	string s;
	cin >> s;
	int a = 0;
	int b = n-1;
	for(int i = 0; i < n; i++) if(s[i] == 'M') a = max(a,i);
	for(int i = 0; i < n; i++) if(s[i] == 'm') b = min(b,i);
	if(a+1 == b){
		multiset<int> d;
		for(int i = 0; i <= b; i++) d.insert(-p[i]);
		multiset<int> e;
		e.insert(-*d.begin());
		for(int i = b+1; i < n; i++){
			d.insert(-p[i]);
			d.erase(d.find(-p[i-(b+1)]));
			e.insert(-*d.begin());
		}
		cout << *e.begin() << endl;
		return 0;
	}
}

Submission Info

Judge Result