题解 | 数字求和(vector排序:sort(nums.begin(), nums.end()))
数字求和
https://www.nowcoder.com/practice/e8cee01f2d834fa9ba3479fafe492b65
#include <algorithm> #include <iostream> #include <vector> using namespace std; #define SIZE 5 int main() { int a; while (cin >> a) { // 注意 while 处理多个 case vector<int> nums(SIZE); int res=0; for (int i = 0; i<SIZE; i++) { cin >> nums[i]; } sort(nums.begin(), nums.end()); for (int i = 0; i<SIZE; i++) { if(nums[i]>=a) break; res+=nums[i]; } cout << res << endl; } } // 64 位输出请用 printf("%lld")