Run ID:153303

提交时间:2026-05-14 15:34:49

#include<bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { int a[10000] = {0}; int sum = 0; string s; cin >> s; int len = s.size(); int j = 0; for (int i = 0; i < len; i++) { if (s[i] != '5') { sum = sum * 10 + (s[i] - '0'); } else { // 只要不是连续 5,就存数(0 也要存) a[j++] = sum; sum = 0; } } // 把最后一段存进去 a[j++] = sum; // 冒泡排序 for (int i = 0; i < j-1; i++) { for (int z = i+1; z < j; z++) { if (a[i] > a[z]) { swap(a[i], a[z]); } } } // 输出 for (int i = 0; i < j; i++) { cout << a[i] << " "; } cout << endl; } return 0; }