斯文~

https://www.acwing.com/problem/content/3776/ 这个注意是二维的，因此可以跳等腰三角形 #include<iostream> using namespace std; int main() { int T,n,x; cin>>T; while(T--) { int t,a=0; int f=0; cin>>n>>x; whi

https://vjudge.net/problem/POJ-3253 和合并果子的题一样 #include<cstdio> #include<iostream> #include<algorithm> #include<queue> using namespace std; int main() { int n,x; long long ans; while(~scanf("%d",&n)) { priority_queue<in