應該有更簡單的算法.....a了算了..
http://acm.hdu.edu.cn/showproblem.php?pid=2020
絕對值排序
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16672 Accepted Submission(s): 8243
- #include<iostream>
- using namespace std;
- int main()
- {
- int n,i,j,temp;
- int num[101];
- while(cin>>n&&n)
- {
- for(i=0;i<n;i++)
- cin>>num[i];
- for(i=0;i<n;i++)
- {
- for(j=i;j<n;j++)
- if(abs(num[i])<abs(num[j]))
- {temp=num[i];num[i]=num[j];num[j]=temp;}
- }
- for(i=0;i<n;i++)
- {
- cout<<num[i];
- if(i!=n-1)
- cout<<" ";
- else
- cout<<"\n";
- }
- }
- return 0;
- }
- int abs(int x)
- {
- if(x>=0)
- return x;
- else
- return -x;
- }