A. Meximization
题面:
代码:
#include<iostream>
#include<vector>
#include<stdio.h>
//习惯一下新的IO流
using namespace std;
const int maxn = 110;
int main() {
int T;
cin >> T;
while (T--) {
int n;
scanf("%d", &n);
vector<int> v(maxn);
for (int i = 0; i < n; ++i) {
int k;
scanf("%d", &k);
v[k]++;
}
int top = 0;
for (int i = 0; i < maxn; i++) {
if (v[i] > 0) {
printf("%d ", i);
v[i]--;
}
}
for (int i = 0; i < maxn; i++) {
while (v[i] > 0) {
printf("%d ", i);
v[i]--;
}
}
printf("\n");
}
}