Codeforces Round 963 (Div. 2)

https://codeforces.com/contest/1993

A. Question Marks

解析：简单题，略

#include <iostream>
#include <string>
#include <cstring>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <math.h>
#include <map>
#include <sstream>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <stdio.h>
#include <tuple>
using namespace std;
typedef long long LL;
//#define int LL
#define ld long double
const LL INF = 0x3f3f3f3f3f3f3f3f;
typedef unsigned long long ULL;
typedef pair<long long, long long> PLL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
const int inf = 0x3f3f3f3f;
const LL Mod = 998244353;
const ld eps = 1e-12;
const int N = 1e5 + 10, M = 1e6 + 10;
int n;
char s[N];

signed main() {
	int T;
	cin >> T;
	while (T--) {
		cin >> n;
		scanf("%s", s + 1);
		int A, B, C, D;
		A = B = C = D = 0;
		for (int i = 1; i <= 4*n; i++) {
			if (s[i] == 'A') {
				A++;
			}
			else if (s[i] == 'B') {
				B++;
			}
			else if (s[i] == 'C') {
				C++;
			}
			else if (s[i] == 'D') {
				D++;
			}
		}
		int ans = 0;
		ans += min(A, n);
		ans += min(B, n);
		ans += min(C, n);
		ans += min(D, n);
		printf("%d\n", ans);
	}
	return 0;
}