排序

排序

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 49749    Accepted Submission(s): 14416


[align=left]Problem Description[/align]
输入一行数字，如果我们把这行数字中的‘5’都看成空格，那么就得到一行用空格分割的若干非负整数（可能有些整数以‘0’开头，这些头部的‘0’应该被忽略掉，除非这个整数就是由若干个‘0’组成的，这时这个整数就是0）。

你的任务是：对这些分割得到的整数，依从小到大的顺序排序输出。

#include<iostream>

#include<string>

#include<vector>

#include<sstream>

#include<algorithm>

using namespace std;

int main()

{
string str;
string patten = "5";
while (cin >> str)
{
vector<long long> res;
int len = str.length();
int pos = 0;
int i;
for ( i = 0; i < len; i++)
{
if (str[i] == '5')
continue;
pos = str.find(patten, i);
if(pos!=-1)
{ 
string sub = str.substr(i, pos - i);
i = pos;
istringstream istream;
istream.str(sub);
long long value;
istream >> value;
res.push_back(value);
istream.clear();
}
else {
break;
}  
}
if (i < len)
{
string end = str.substr(i, len  - i);
istringstream istream;
istream.str(end);
long long value;
istream >> value;
res.push_back(value);
istream.clear();
}

sort(res.begin(), res.end());
int size = res.size();
for (int i = 0; i < size-1; i++)
{
cout << res[i] << " ";
}
cout <<res[size-1]<< endl;
}
return 0;
}

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

char s[1005];

long long  a[1005];

char * temp;

int cmp(const void *p1, const void *p2) {
return *(int *)p1 - *(int *)p2;

}

int main() {
int c;
while (gets_s(s)) {
a[0] = atoi(strtok(s, "5"));
c = 1;
while (temp = strtok(NULL, "5")) {
a[c++] = atoi(temp);
}
qsort(a, c, sizeof a[0], cmp);
for (int i = 0; i<c; i++) {
printf(i == c - 1 ? "%d\n" : "%d ", a[i]);
}
}
return 0;

}