hdu 5182(结构体排序)

PM2.5

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1217    Accepted Submission(s): 607

Problem Description

Nowadays we use content of PM2.5 to discribe the quality of air. The lower content of PM2.5 one city have, the better quality of air it have. So we sort the cities according to the content of PM2.5 in asending order.

Sometimes one city’s rank may raise, however the content of PM2.5 of this city may raise too. It means that the quality of this city is not promoted. So this way of sort is not rational. In order to make it reasonable, we come up with a new way to sort the cityes. We order this cities through the diffrence between twice measurement of content of PM2.5 (first measurement – second measurement) in descending order, if there are ties, order them by the second measurement in asending order , if also tie, order them according to the input order.

 

Input

Multi test cases (about 100), every case contains an integer n which represents there are n cities to be sorted in the first line.
Cities are numbered through 0 to n−1.
In the next n lines each line contains two integers which represent the first and second measurement of content of PM2.5
The ith line describes the information of city i−1
Please process to the end of file.

[Technical Specification]
all integers are in the range [1,100]

 

Output

For each case, output the cities’ id in one line according to their order.

 

Sample Input

2 100 1 1 2 3 100 50 3 4 1 2

 

Sample Output

0 1 0 2 1

 

Source

BestCoder Round #32

 

题意:给出每个城市 id ，frist 以及 second ,首先按照 first - second 降序排,如果相等按照 second 升序,如果再相等按照 id 升序.WA了很多次....给我的教训是写代码一定要规范 ,先按照优先级从小到大依次返回就很难错了。。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <math.h>
using namespace std;
struct Node{
    int first,second,change;
    int id;
}node[200];
int cmp(Node a,Node b){
     if(a.change==b.change&&a.second==b.second) return a.id<b.id;
     if(a.change==b.change) return a.second<b.second;
     return a.change>b.change;
    /*if(a.change==b.change&&a.second!=b.second) return a.second<b.second; ///教训
    else if(a.change==b.change&&a.second==b.second) return a.id<b.id;
    return a.change>b.change;*/
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF){
        for(int i=0;i<n;i++){
            scanf("%d%d",&node[i].first,&node[i].second);
            node[i].change = node[i].first - node[i].second;
            node[i].id = i;
        }
        sort(node,node+n,cmp);
        for(int i=0;i<n-1;i++){
            printf("%d ",node[i].id);
        }
        printf("%d
",node[n-1].id);
    }
    return 0;
}