#include <iostream>
#include <math.h>
#include <string.h>
#include<algorithm>
using namespace std;
struct node
{
int price;
int quality;
};struct node w[110];
int compare(struct node a,struct node b)
{
if(a.quality==b.quality)
return a.price>b.price;
return a.quality<b.quality;
}
int main()
{
int n,i;
while(cin>>n)
{
for(i=0;i<n;i++)
{
cin>>w[i].quality;
}
for(i=0;i<n;i++)
{
cin>>w[i].price;
}
sort(w,w+n,compare);
for(i=0;i<n;i++)
{
cout<<w[i].quality<<" "<<w[i].price<<endl;
}
}
return 0;
}
用C++自带的sort函数进行结构体快排3个参数
最新推荐文章于 2024-03-05 16:49:12 发布