#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
struct cmp1
{
bool operator ()(int &a,int &b)
{
return a<b;
}
};
struct cmp2
{
bool operator ()(int &a,int &b)
{
return a>b;
}
};
priority_queue<int,vector<int>,cmp1>q1;
priority_queue<int,vector<int>,cmp2>q2;
int main()
{
for(int i=1;i<=5;i++)
{
int x=0;
cin>>x;
q1.push(x);
q2.push(x);
}
cout<<q1.top()<<" "<<q2.top();
#include<algorithm>
#include<queue>
using namespace std;
struct cmp1
{
bool operator ()(int &a,int &b)
{
return a<b;
}
};
struct cmp2
{
bool operator ()(int &a,int &b)
{
return a>b;
}
};
priority_queue<int,vector<int>,cmp1>q1;
priority_queue<int,vector<int>,cmp2>q2;
int main()
{
for(int i=1;i<=5;i++)
{
int x=0;
cin>>x;
q1.push(x);
q2.push(x);
}
cout<<q1.top()<<" "<<q2.top();
q1.pop();
q2.pop();
return 0;
}
return 0;
}
注意最后面的比较运算符为非,就是小于号输出的是最大值
输入1 2 3 4 5
输出5 1