一个简单的水果价格排序；以及一个int的测试
#include <iostream> #include <vector> #include <math.h> #include <set> #include <queue> #include <map> using namespace std; struct fruit{ string name; int price; friend bool operator<(fruit f1,fruit f2){ return f1.price>f2.price; } }f1,f2,f3; int main(int argc, const char * argv[]) { //queue<int>q; priority_queue<fruit>q; priority_queue<int,vector<int>,greater<int>>q2;//---默认大的优先，这句优先小的 f1.name="桃子"; f1.price=3; f2.name="栗子"; f2.price=4; f3.name="苹果"; f3.price=1; q.push(f1); q.push(f2); q.push(f3); cout<<q.top().name<<" "<<q.top().price<<endl<<"============\n"; q2.push(3); q2.push(4); q2.push(1); cout<<q2.top()<<endl; return 0; }