老--质价比
Time Limit: 1000 ms
Memory Limit: 65536 KiB
Problem Description
给出n件物品,每件物品有质量和价格两种属性。你要做的是按质量升序排序,若质量相同则按价格降序排序。
Input
多组输入。每组先输入一个正整数n(1<=n && n <= 100),代表有n件物品。接下来的一行有n个正整数Wi(1<= Wi && Wi <= 10000),代表每件物品的质量。再接下来的一行有n个正整数Pi(1 <= Pi && Pi <= 10000),代表每件物品的价格。
Output
对于每组数据输出n行,每行两个数Wi,Pi。顺序为题目描述所要求。
Sample Input
3 1 2 2 3 2 3
Sample Output
1 3 2 3 2 2
01 | #include<stdio.h> |
02 | struct wp |
03 | { |
04 | int money; |
05 | int mass; |
06 | } s[10010] ; |
07 | int main() |
08 | { |
09 | int n, i, j; |
10 | struct wp temp; |
11 | while ( scanf ( "%d" ,&n)!=EOF) |
12 | { |
13 | for (i=0;i<n;i++) |
14 | scanf ( "%d" ,&s[i].mass); |
15 | for (i=0;i<n;i++) |
16 | scanf ( "%d" ,&s[i].money); |
17 |
18 | for (j=0;j<n-1;j++) |
19 | for (i=0;i<n-j-1;i++) |
20 | { |
21 | if (s[i].mass>s[i+1].mass) |
22 | { |
23 | temp=s[i]; |
24 | s[i]=s[i+1]; |
25 | s[i+1]=temp; |
26 | } |
27 | if (s[i].mass==s[i+1].mass&&s[i].money<s[i+1].money) |
28 | { |
29 | temp=s[i]; |
30 | s[i]=s[i+1]; |
31 | s[i+1]=temp; |
32 | } |
33 | } |
34 |
35 | for (i=0;i<n;i++) |
36 | printf ( "%d %d\n" ,s[i].mass,s[i].money); |
37 | } |
38 | return 0; |
39 | } |
40 |
41 | /*************************************************** |
42 | User name: jk170618李博 |
43 | Result: Accepted |
44 | Take time: 0ms |
45 | Take Memory: 140KB |
46 | Submit time: 2018-03-11 16:49:04 |
47 | ****************************************************/ |