80851 596721
95119814093463654797693496967652751373442858974914561764151391674898526697383637702537
<233904 bytes omitted>
用户输出
80850
系统信息
Exited with return code 0
编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
---|---|---|---|---|---|---|---|---|
#668 | #1020. jwp的采购之旅 | Accepted | 100 | 46 ms | 740 K | C++ / 389 B | lenijwp | 2019-06-24 21:09:44 |
#include <bits/stdc++.h>
using namespace std;
int n, T;
#define MAXN 100010UL
int a[MAXN];
int main() {
// freopen("1.in","r",stdin);
// freopen("1.out","w",stdout);
cin >> n >> T;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (T >= a[i]) {
cnt++;
T -= a[i];
} else {
break;
}
}
printf("%d", cnt);
return 0;
}
80851 596721
95119814093463654797693496967652751373442858974914561764151391674898526697383637702537
<233904 bytes omitted>
用户输出
80850
系统信息
Exited with return code 0
8567 568993
896624492332499581419766577429086941760857398871169438573442941337247493214902623320629
<24673 bytes omitted>
用户输出
8566
系统信息
Exited with return code 0
50241 61565
352772555196242144395753020358287987062135014310626856032485679230123024495417135517865
<145264 bytes omitted>
用户输出
50240
系统信息
Exited with return code 0
78233 601123
45612894285567045053677423365826933630385781215278636152318958485663365769926130664626
<226096 bytes omitted>
用户输出
78232
系统信息
Exited with return code 0