堆的性质: 对除根以外的每个节点i，A[parent(i)]>=A[i]A[parent(i)] >= A[i]A[parent(i)]>=A[i]。即除根结点以外，所有结点的值都不得超过其父节点的值，这样堆中的元素存放在根节点中，且每一节点的子树中的结点都小于等于该节点的值，这种堆叫做大根堆；反之，对除了跟节点以外的每个节点i，A[parent(i)]<=A[i]A[parent(i)] <= A[i]A[parent(i)]<=A[i]的堆，称为“小根堆”。(((A[k]A[k]A[k] 代表结点k,parent(k)parent(k)parent(k)代表节点kkk的父节点)))

大家试一下，我1.26MB 如下，无万能头

欢迎大家做题，找bug,如果又不好之处，多多体谅，谢谢大家

| | A错 B错 C错 D错 --- --- J错 H错 --- --- L 对 J错

答案 ABCDEFJHL ？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？就不给你看

表情全包

好题不如破题

好题不如破题

这个代码为什么提交失败？ #include<bits/stdc++.h> using namespace std; int main(){ long long n,m,a; cin>>n>>m>>a; if(n%a0) n/=a; else n=n/a+1; if(m%a0) m/=a; else m=m/a+1; cout<<n*m<<endl; return 0; }

测试点4显示MLE，怎么优化啊 n = int(input()) a = list(map(int, input().split())) b = list(map(int, input().split())) lst1 = [] for i in range(n): ai = a[i] for j in range(n): lst1.append(ai + b[j]) lst1.sort() lst2 = lst1n print(' '.join(map(str, lst2)))

？？？ 有人能指点一下吗？？？

一、上节课作业部分 1. 细胞数量 2. 打开转盘锁 二、课堂案例部分

尊敬的同学，您好，很抱歉打扰到了您，如果您有时间，请加入我们"HTTPS://WWW.ACGO.CN/APPLICATION/1940677638216290304"，很期待您的加入，谢谢；如果你不想参加这个团队，那我向您说声对不起，祝您在ACGO的成功路上越走越远，再见！ 记得跟副团加好友（主团不经常上线）

题目描述 This is yet another problem on regular bracket sequences. A bracket sequence is called regular, if by inserting "+" and "1" into it we get a correct mathematical expression. For example, sequences "(())()", "()" and "(()(()))" are regular, while ")(", "(()" and "(()))(" are not. You have a pattern of a bracket sequence that consists of characters "(", ")" and "?". You have to replace each character "?" with a bracket so, that you get a regular bracket sequence. For each character "?" the cost of its replacement with "(" and ")" is given. Among all the possible variants your should choose the cheapest. 给一个序列，序列里面会有左括号、问号、右括号。对于一个‘？’而言，可以将其替换为一个‘（’，也可以替换成一个‘）’，但是都有相应的代价。问：如何替换使得代价最小。前提是替换之后的序列中，括号是匹配的。如果不能替换为一个括号匹配的序列则输出-1。 输入格式 THE FIRST LINE CONTAINS A NON-EMPTY PATTERN OF EVEN LENGTH, CONSISTING OF CHARACTERS "(", ")" AND "?". ITS LENGTH DOESN'T EXCEED 5 ⋅ 1 0 4 5⋅10 4 . THEN THERE FOLLOW � M LINES, WHERE � M IS THE NUMBER OF CHARACTERS "?" IN THE PATTERN. EACH LINE CONTAINS TWO INTEGER NUMBERS � � A I AND � � B I ( 1 < � � , � � < 1 0 6 1<=a i ,b i <=10 6 ), where � � a i is the cost of replacing the � i -th character "?" with an opening bracket, and � � b i — with a closing one. 第一行是序列，序列长度不超过 5 × 1 0 4 5×10 4 ，下面 � m（ � m是？的数量）行有每行 2 2 个数据，第一个是 '（'的代价，第2个是 '）' 的代价。 输出格式 Print the cost of the optimal regular bracket sequence in the first line, and the required sequence in the second. Print -1, if there is no answer. If the answer is not unique, print any of them. 第一行输出最小代价，第二行输出替换后的序列。不行输出 − 1 −1。 输入输出样例 输入#1 (??) 1 2 2 8 输出#1 4 ()() 谁敢做？！

各位怎么样 （IP噩梦浙江 J组的 第一题错了（bushi 为什么都说这次很难啊我感觉还好

#include <iostream> using namespace std; int main ( ) { int Chinese,math,English; cout<<"Chinese"<<"="<<"<95>"; return 0; }

#include <bits/stdc++.h> using namespace std; long long a[4]; int main(){ for (int i = 0;i < 3;i++) cin >> a[i]; sort(a,a+3); for (int i = 0;i < 3;i++) cout << a[i] << " "; return 0; } 啊啊啊

这道题不用·那么复杂，用for循环就行了 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 放心，保准AC

不知道 滚蛋吧c++ 看了会怎么样