WAM

题目略

解法：

桶

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
#define endl '\n'
void solve() {
	int n; cin >> n;
	vector<int> tong(26, 0);
	string s;
	cin >> s;
	for (int i = 0; i < n; i++) {
		tong[s[i] - 'A']++;
	}
	int mn1 = min(tong['W' - 'A'], tong[0]);
	int mn2 = min(tong['R' - 'A'], tong['N'-'A']);
	int mna = min(mn1, tong['M' - 'A']);
	int mnb = min(mn2, tong['M' - 'A']);
	if (mna >= mnb) {
		cout << mna - mnb << endl;
	}
	else cout << 0 << endl;
}
int main()
{
	int t; cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}