1106stl 排序.cpp

ACM 威士忌部分答案

/*
1106stl 排序
Time Limit : 1000 ms  Memory Limit : 32768 K  Output Limit : 5120 K  

GUN C++
*/
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
  string s, sub;
  int i;
  vector<int> v;

  while(cin >> s){
    v.clear();
    for ( i = 0; i < s.size(); i++ ){
        if ( s[i] == '5' ){
          if ( !sub.empty() ) {
            v.push_back( atoi( sub.c_str() ) );
            sub = "";
          }
        }
        else{
          sub += s[i];
        }
    }
    if ( !sub.empty() ) {
        v.push_back( atoi( sub.c_str() ) );
        sub = "";
    }

    sort(v.begin(), v.end());

    for ( i = 0; i < v.size() - 1; i++ ){
        cout << v[i] << ' ';
    }
    cout << v[i] << endl;
  }

  return 0;
}