QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #661263 | #9423. Gold Medal | Eunoiay | WA | 1ms | 3876kb | C++20 | 611b | 2024-10-20 15:32:30 | 2024-10-20 15:32:31 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
i64 ans = 0;
for (int i = 0; i < n; i++) {
ans += a[i] / k;
a[i] %= k;
}
sort(a.begin(), a.end());
int m;
cin >> m;
for (int x : a) {
if (x > 0 && m >= k - x) {
ans += 1;
m -= k - x;
}
}
ans += m / k;
cout << ans << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3648kb
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: 3876kb
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 114876506 0 13117 1427237708 12524 19423 0 35634 4 266 34841131 731790799 8 11 0 51508673 2 262191 175 6286240839 0 1045 293089 167116 4 141328 455003437 86185475 14 1963 11 491358 163 8953 3869760302 14424321 31849 560665 133717 6261 99 11983 23...
result:
wrong answer 11th lines differ - expected: '114876519', found: '114876506'