1
MAX = 3 * 10 ** 5
2
a = [0] * (MAX + 1)
3
c = [0] * (MAX + 1)
4
n, q = map(int, input().split())
5
mn = 0
6
for _ in range(q):
7
    t, x = map(int, input().split())
8
    if t == 1:
9
        # 操作1：在格子 x 加一个方块
10
        a[x] += 1
11
        c[a[x]] += 1
12
        # 如果某个高度 v 的格子数达到了 n，说明每个格子至少有 v 块
13
        if c[a[x]] == n:
14
            mn = a[x]
15
    else:
16
        # 查询：至少 y 块 = 至少 y+mn 块
17
        need = x + mn
18
        if need > MAX:
19
            print(0)
20
        else:
21
            print(c[need])

1
for _ in range(int(input())):
2
    s = input()
3
    n = len(s)
4
    cnt = [0] * 26
5
    for c in s:
6
        cnt[ord(c) - ord("a")] += 1
7
    if max(cnt) > (n + 1) // 2:
8
        print("No")
9
        continue
10
    ans = []
11
    prev = -1
12
    while True:
13
        val = 0
14
        idx = -1
15
        for i in range(26):
16
            if i == prev:
17
                continue
18
            if val < cnt[i]:
19
                idx = i
20
                val = cnt[i]
21
        if idx == -1:
22
            break
23
        ans.append(chr(ord('a') + idx))
24
        cnt[idx] -= 1
25
        prev = idx
26
    print("Yes")
27
    print("".join(ans))

1
import heapq
2
from collections import Counter
3
for _ in range(int(input())):
4
    s = input().strip()
5
    n = len(s)
6
    freq = Counter(s)
7
    if max(freq.values()) > (n + 1) // 2:
8
        print("No")
9
        continue
10
    heap = [(-cnt, ch) for ch, cnt in freq.items()]
11
    heapq.heapify(heap)
12
    res = []
13
    prev = None
14
    while heap:
15
        cnt1, ch1 = heapq.heappop(heap)
16
        if ch1 == prev:
17
            if not heap:
18
                break
19
            cnt2, ch2 = heapq.heappop(heap)
20
            res.append(ch2)
21
            prev = ch2
22
            if -cnt2 > 1:
23
                heapq.heappush(heap, (cnt2 + 1, ch2))
24
            heapq.heappush(heap, (cnt1, ch1))
25
        else:
26
            res.append(ch1)
27
            prev = ch1
28
            if -cnt1 > 1:
29
                heapq.heappush(heap, (cnt1 + 1, ch1))
30
    print("Yes")
31
    print(''.join(res))

1
#include <stdio.h>
2
#include <stdlib.h>
3
#include <string.h>
4
#define MAX_CHAR 26
5
typedef struct {
6
    char ch;
7
    int cnt;
8
} Node;
9
int cmp(const void* a, const void* b) {
10
    Node* nodeA = (Node*)a;
11
    Node* nodeB = (Node*)b;
12
    return nodeB->cnt - nodeA->cnt;
13
}
14
char* reorganizeString(char* s) {
15
    int n = strlen(s);
16
    int freq[26] = {0};
17
    for (int i = 0; i < n; i++) {
18
        freq[s[i] - 'a']++;
19
    }
20
    int maxFreq = 0;
21
    for (int i = 0; i < 26; i++) {
22
        if (freq[i] > maxFreq) {
23
            maxFreq = freq[i];
24
        }
25
    }
26
    if (maxFreq > (n + 1) / 2) {
27
        return "";
28
    }
29
    char* res = (char*)malloc((n + 1) * sizeof(char));
30
    res[n] = '\0';
31
    int resIdx = 0;
32
    char prev = '\0';
33
    while (1) {
34
        int bestIdx = -1;
35
        int bestCnt = 0;
36
        for (int i = 0; i < 26; i++) {
37
            if (freq[i] > 0 && (char)(i + 'a') != prev) {
38
                if (freq[i] > bestCnt) {
39
                    bestCnt = freq[i];
40
                    bestIdx = i;
41
                }
42
            }
43
        }
44
        if (bestIdx == -1) {
45
            break;
46
        }
47
        char ch = (char)(bestIdx + 'a');
48
        res[resIdx++] = ch;
49
        freq[bestIdx]--;
50
        prev = ch;
51
    }
52
    if (resIdx != n) {
53
        free(res);
54
        return "";
55
    }
56
    return res;
57
}