绌洪棽鎬�

include #include #include #include using namespace std; int main() { int n; cin >> n; vector v(n); int sum = 0; for (int i = 0; i < n; i++) { cin >> v[i]; sum += v[i]; } sort(v.begin(), v.end()); int count = 0; int temp = 0; for (int i = n - 1; i >= 0; i--) { temp += v[i]; count++; if (temp > sum - temp) { break; } } cout << count << endl; return 0; }

---

抱歉，此页面的内容受版权保护，复制需扣除次数，次数不足时需付费购买。

如需下载请点击：点击此处下载

关闭

扫码付费即可复制
X

• 在通信搜索中检索“绌洪棽鎬仭�

LTERRCReestablishFail | LTEPrach:Msg2 Fail | personal device | 32T32鍜孴8T8R鍖哄埆 | 32tr鍜�8tr鍖哄埆 | 閽堝瓙 | 甯у瓙 | 8t8r | 32T32R | 浜ゅ弶鏋佸寲 | 浜ゅ弶鏋佸寲姣� | 浜ゅ弶鏋佸寲鍔熺巼姣� |