mirror of
https://github.com/wczffl-503/OI-Codes.git
synced 2025-07-08 02:13:51 +08:00
归类了 OJ,整理了一下
This commit is contained in:
38
XSM OJ 重庆小码王集团OJ/小码学院的志愿者.cpp
Normal file
38
XSM OJ 重庆小码王集团OJ/小码学院的志愿者.cpp
Normal file
@ -0,0 +1,38 @@
|
||||
#include <algorithm>
|
||||
#include <iostream>
|
||||
#include <iomanip>
|
||||
#include <cstring>
|
||||
#include <cstdio>
|
||||
#include <ctime>
|
||||
#include <cmath>
|
||||
typedef long long l;
|
||||
typedef double d;
|
||||
typedef char c;
|
||||
using namespace std;
|
||||
struct rect{
|
||||
int sc;
|
||||
int nd;
|
||||
int id;
|
||||
}arr[100000];
|
||||
bool cmp(rect a,rect b){
|
||||
if(a.sc*a.nd==b.sc*b.nd){
|
||||
if(a.sc*a.nd==b.sc*b.nd && a.sc==b.sc){
|
||||
return a.id<b.id;
|
||||
}
|
||||
return a.sc>b.sc;
|
||||
}
|
||||
return a.sc*a.nd>b.sc*b.nd;
|
||||
}
|
||||
int main(){
|
||||
int a;
|
||||
cin >>a;
|
||||
for(int i=0;i<a;i++){
|
||||
cin >>arr[i].sc>>arr[i].nd;
|
||||
arr[i].id=i;
|
||||
}
|
||||
sort(arr,arr+a,cmp);
|
||||
for(int i=0;i<a;i++){
|
||||
cout <<arr[i].id+1<<" ";
|
||||
}
|
||||
return 0;
|
||||
}
|
Reference in New Issue
Block a user