向宇同桌:恭喜~~ 分享一下面经啦

0 点赞 评论 收藏
分享

0 点赞 评论 收藏
分享
JamesShao:运货的
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{ int L=0,w,wsum=0; vector<int> weight; while (cin>>w) weight.push_back(w); sort(weight.begin(), weight.end()); int left = 0, right = weight.size() - 1; int count = 0; for (int i = 0; i < weight.size(); ++i) if (weight[i] == 100) ++count; if (count>=3) { L = count / 3; left = L * 3; } while (left < right) { if (weight[left] + weight[right]>300) { --right; ++L; } else { ++left; --right; ++L; } } if (left == right) ++L; cout << L << endl; system("pause"); return 0;
}

0 点赞 评论 收藏
分享
创作者周榜
更多
关注他的用户也关注了: