Title Description:
Source:
#include "iostream" #include "string" using namespace std;void Order (int *p, int n) {int tmp;if (n < 2) return;for (int i = 0; i < n-1; i++) {for (int j = 0, J < n-i-1, j + +) {if (P[j] > p[j + 1]) { tmp = p[j];p [j] = P[j + 1];p [j + 1] = tmp;}}} int main () {string Str;int nums[501], count, start, Len, Num;bool ok;while (cin>>str) {count = 0;start = 0;len = Str.le Ngth (); for (int i = 0; i < len; i++) {if (str[i] = = 5 ') {start++;} Else{break;}} num = 0;ok = true;for (int i = start; i < Len; i++) {if (str[i]! = ' 5 ') {OK = True;num = num * + (Str[i]-' 0 ');} Else{if (OK) {Nums[count] = Num;count++;num = 0;ok = false;}}} if (str[len-1]! = ' 5 ') {Nums[count] = num;count++;} Order (Nums, Count), for (int i = 0; i < count; i++) {if (i > 0) cout<< ""; cout<<nums[i];} Cout<<endl;} return 0;}
HD-ACM Algorithm Specialization series (7)--Sort