CodeForces 1348C :Phoenix and Distribution 思维构造_1348c

本文链接：https://blog.csdn.net/tlyzxc/article/details/119514963

传送门

题意

给定大小为 $n$ 的字符集合 $s$ ，字符可能重复，要求将其分成 $k$ 个字符串，使得字典序最大的字符串字典序最小，输出这个字典序最大的字符串。

分析

贪心分配一下，把字符排个序，前 $k$ 个和后面 $n - k$ 个进行一下分配即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
char str[N];
int n,m;

int main() {
	int T;
	read(T);
	while(T--){
		read(n),read(m);
		scanf("%s",str + 1);
		sort(str + 1,str + 1 + n);
		if(str[1] != str[m]) printf("%c\n",str[m]);
		else {
			if(str[m + 1] != str[n]) for(int i = m;i <= n;i++) printf("%c",str[i]);
			else {
				int x = (n - m) / m;
				if(x * m != n - m) x++;
				printf("%c",str[m]);
				for(int i = 1;i <= x;i++) printf("%c",str[m + i]);
			}
			puts("");
		}
	}

}