求救

P1090 [NOIP2004 提高组] 合并果子 / [USACO06NOV] Fence Repair G

```cpp #include <bits/stdc++.h> using namespace std; int n, n2, a[10010], a2[10010]; int main() { memset(a,127, sizeof(a));memset(a2, 127, sizeof(a2)); int n; cin >> n; for (int i = 0;i <= n - 1; ++i) { cin >> a[i]; } sort(a, a + n); int i = 0, j = 0, sum = 0, w; for (int k = 1;k < n; ++k) { w = a[i] < a2[j] ? a[i++] : a2[j++]; w += a[i] < a2[j] ? a[i++] : a2[j++]; a2[n2++] = w; sum += w; } cout << sum; return 0; } ``` 我之前写的代码跟你的很像啊哈哈,可以参考一下
by _Ayanami_Rei_ @ 2022-10-07 11:29:05


谢谢dalao
by YE_min @ 2022-12-04 14:52:36


|