PM2.5
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 551 Accepted Submission(s): 308
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.
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]
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
这个题目是第一题,本来十分简单,但是理解错了最后一句英语的释义,
For each case, output the cities’ id in one line according to their order.
以为是要求最后的每个城市的名次,没想到最后的样例竟然都过了。。。。
坑
#include<iostream>
#include<math.h>
#include<fstream>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
typedef long long LL;
const int MAX=0xfffffff;
#define PI 3.1415927
struct node{
int a,b;
int t1,t2;
}s[100000];
bool cmp1(node A,node B)
{
int t1=A.a-A.b;
int t2=B.a-B.b;
if(t1!=t2) return t1>t2;
else
{
if(A.b!=B.b) return A.b<B.b;
else return A.t1<B.t1;
}
}
//bool cmp2(node A,node B)
//{
// return A.t1<B.t1;
//}
int main( )
{
//freopen("1.txt","r",stdin);
int n;
while(scanf("%d",&n)!=EOF)
{
for(int i=0;i<n;i++)
{
cin>>s[i].a>>s[i].b;
s[i].t1=i;
}
sort(s,s+n,cmp1);
/*for(int i=0;i<n;i++)
{
s[i].t2=i;
}*/
// sort(s,s+n,cmp2);
/*for(int i=0;i<n;i++)
if(i==n-1) cout<<s[i].t2<<" "<<endl;
else cout<<s[i].t2<<" ";*/
for(int i=0;i<n;i++)
{
if(i==n-1) cout<<s[i].t1<<endl;
else cout<<s[i].t1<<" ";
}
}
return 0;
}
#include<math.h>
#include<fstream>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
typedef long long LL;
const int MAX=0xfffffff;
#define PI 3.1415927
struct node{
int a,b;
int t1,t2;
}s[100000];
bool cmp1(node A,node B)
{
int t1=A.a-A.b;
int t2=B.a-B.b;
if(t1!=t2) return t1>t2;
else
{
if(A.b!=B.b) return A.b<B.b;
else return A.t1<B.t1;
}
}
//bool cmp2(node A,node B)
//{
// return A.t1<B.t1;
//}
int main( )
{
//freopen("1.txt","r",stdin);
int n;
while(scanf("%d",&n)!=EOF)
{
for(int i=0;i<n;i++)
{
cin>>s[i].a>>s[i].b;
s[i].t1=i;
}
sort(s,s+n,cmp1);
/*for(int i=0;i<n;i++)
{
s[i].t2=i;
}*/
// sort(s,s+n,cmp2);
/*for(int i=0;i<n;i++)
if(i==n-1) cout<<s[i].t2<<" "<<endl;
else cout<<s[i].t2<<" ";*/
for(int i=0;i<n;i++)
{
if(i==n-1) cout<<s[i].t1<<endl;
else cout<<s[i].t1<<" ";
}
}
return 0;
}