本文共 888 字,大约阅读时间需要 2 分钟。
#include#include #include using namespace std;bool cmp(int x,int y) { return x > y;}int main() { int a[10] = { 5,1,2,6,2,5}; sort(a,a+6,cmp); for (int i = 0; i < 6; i++) { printf("%d ",a[i]); } return 0;}
大于或等于num
int pos = lower_bound(num,num+6,7);
大于num
int pos = lower_bound(num,num+6,7);
小于或等于num
int pos = lower_bound(num,num+6,7,greater );
int pos = lower_bound(num,num+6,7,greater );
priority_queue(int) q;q.push(1);q.push(2);q.push(3);
setcountry;country.insert("China");country.insert("America");country.insert("France");
转载地址:http://zvzsi.baihongyu.com/