QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #799467 | #9423. Gold Medal | fsy_juruo | WA | 1ms | 3676kb | C++17 | 652b | 2024-12-05 14:31:42 | 2024-12-05 14:31:42 |
Judging History
answer
#include <bits/stdc++.h>
using LL = long long;
const int maxN = 1e3 + 10;
int T, n, k, m;
int a[maxN];
int main() {
std::ios::sync_with_stdio(false); std::cin.tie(nullptr);
std::cin >> T;
while(T--) {
std::cin >> n >> k;
for(int i = 1; i <= n; i++) {
std::cin >> a[i];
}
std::cin >> m;
std::sort(a + 1, a + n + 1, [&](int x, int y) {
return (k - x % k < k - y % k);
});
for(int i = 1; i <= n; i++) {
int t = k - a[i] % k;
a[i] += std::min(m, t);
m -= std::min(m, t);
}
int ans = m / k;
for(int i = 1; i <= n; i++) {
ans += a[i] / k;
}
std::cout << ans << "\n";
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3676kb
input:
2 3 10 239 141 526 6 2 1 300 100 1000
output:
91 1400
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3612kb
input:
100 39 88 746 86884 628655 868 87506 46761498 3338 91952768 312 9712 5277106 2263554 246545 98849 91459 6 5506 4 17626 5984050 32079 10 7672277 8104250 62 8976 866448 1 4 62240996 93128 181 6 9 5 175665 9 7680943 81 239822 9 200383 53147 17 82509 3 617847780 418677763 5402536 16 38253558 79857 66 60...
output:
2734453 5390 65 0 66483181 44507 54 0 166366037 76709 114876519 0 13117 1427237708 12524 19426 0 35644 4 266 34841131 731790799 9 11 0 51508673 2 262191 175 1991273543 0 1045 293089 167116 4 141328 455003437 86185475 14 1963 11 491358 163 8970 -425206994 14424321 31849 560665 133717 6261 99 11983 23...
result:
wrong answer 30th lines differ - expected: '6286240839', found: '1991273543'