Why just 70 pts?

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

TLE还是WA
by Henry2012 @ 2023-08-17 20:48:00


@[Henry2012](/user/745332) WA了3个点
by Demo_B11 @ 2023-08-18 08:01:54


@[Henry2012](/user/745332) [提交记录](https://www.luogu.com.cn/record/121504248)
by Demo_B11 @ 2023-08-18 08:02:44


@[Demo_B11](/user/1040770) 仅供参考 ```cpp #include<bits/stdc++.h> using namespace std; int main(){ //典型的贪心,每一次都只合并所花力气最小的两堆果子! int a[10000], n, sum = 0; cin >> n; for (int i = 1; i <= n; i++){ cin >> a[i]; } sort(a + 1, a + n + 1); //初始排序 for (;;){ int j = 1; if (j == n) break; else{ a[j] += a[j + 1]; sum += a[j]; for (int i = j + 1; i < n; i++){ //将第一堆后面的前移一个位置,去掉最后一堆 a[i] = a[i + 1]; } n--; for (int i = j; i < n; i++){ //把果子堆重新再从小到大排序继续循环直至跳出! if (a[i] > a[i + 1]) swap(a[i], a[i + 1]); } } } cout << sum << endl; return 0; } ```
by Kimi_0406 @ 2023-08-19 18:00:10


@[Kimi_0406](/user/1067870) 谢谢
by Demo_B11 @ 2023-08-20 12:38:30


|