掌上游戏机电池优化 - 最大化游戏时间

#include "iostream"\n#include "vector"\n#include "algorithm"\n#include "iomanip"\nusing namespace std; \n\nint main() { \n int n; \n while (cin >> n) { \n vector batteries(n); \n for (int i = 0; i < n; i++) { \n cin >> batteries[i]; \n } \n sort(batteries.begin(), batteries.end(), greater()); \n \n double maxTime = 0; \n for (int i = 0; i < n; i++) { \n double tempTime = 0; \n for (int j = 0; j < i; j++) { \n tempTime += batteries[j]; \n } \n tempTime += batteries[i] / 2.0; \n maxTime = max(maxTime, tempTime); \n } \n \n cout << fixed << setprecision(1) << maxTime << endl; \n } \n \n return 0; \n}