zoukankan      html  css  js  c++  java
  • BestCoder Round #32——1001——PM2.5

    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 n1.
    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 i1
    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
     
    Recommend
    大意:写个cmp就行orz结果自己一直在写if还过不了
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    struct edge{
        int l;
        int m;
        int id;
    }a[105];
    bool cmp(edge i,edge j){
        if(i.m != j.m)
        return i.m > j.m ;
        else {
                if(i.l != j.l)
                return i.l < j.l;
        else if(i.l == j.l) return i.id < j.id;
    
      }
    }
    int main()
    {
        int n,b,c;
        while(~scanf("%d",&n)){
                for(int i = 1; i <= n ; i++){
                scanf("%d%d",&b,&c);
                a[i].m = b - c;
                a[i].l = c;
                a[i].id = i - 1;
                }
                sort(a+1,a+n+1,cmp);
                for(int i = 1; i < n ; i++)
                    printf("%d ",a[i].id);
                printf("%d
    ",a[n].id);
        }
        return 0;
    }
    View Code
  • 相关阅读:
    【Hadoop学习之七】Hadoop YARN
    【Hadoop学习之六】MapReduce原理
    【Hadoop学习之五】win7+Eclipse+hadoop3搭建本机开发环境
    【Hadoop学习之四】HDFS HA搭建(QJM)
    【Hadoop学习之三】Hadoop全分布式安装
    【Hadoop学习之二】Hadoop伪分布式安装
    【Hadoop学习之一】Hadoop介绍
    【Linux学习十】负载均衡带来tomcat的session不一致问题
    【Linux学习九】负载均衡
    Okhttp3基本使用
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4350097.html
Copyright © 2011-2022 走看看