随风浪子~

摘要： 1 # include 2 # include 3 # include 4 #include 5 using namespace std; 6 const int MAX = 30001; 7 int A[MAX]; 8 int main() 9 {10 int m,n,i,j,k;11 priority_queue q2; //最大堆(默认)；12 priority_queue,greater > q1;//最小堆(自定义)；13 scanf("%d%d",&n,&m);14 for(i=0;i<n;i++)15 scanf(... 阅读全文