QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#682205 | #9423. Gold Medal | Lautisticyc | AC ✓ | 1ms | 3744kb | C++14 | 446b | 2024-10-27 14:24:31 | 2024-10-27 14:24:31 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int t,n,k,a[110],m;
long long ans;
int main()
{
scanf("%d",&t);
while(t--)
{
ans=0;
scanf("%d %d",&n,&k);
for(int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
ans+=a[i]/k;
a[i]=k-a[i]%k;
}
scanf("%d",&m);
sort(a+1,a+1+n);
for(int i=1;i<=n;++i)
{
if(m>=a[i])
{
++ans;
m-=a[i];
}
}
ans+=m/k;
printf("%lld\n",ans);
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3744kb
input:
2 3 10 239 141 526 6 2 1 300 100 1000
output:
91 1400
result:
ok 2 lines
Test #2:
score: 0
Accepted
time: 1ms
memory: 3740kb
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 6286240839 0 1045 293089 167116 4 141328 455003437 86185475 14 1963 11 491358 163 8970 3869760302 14424321 31849 560665 133717 6261 99 11983 23...
result:
ok 100 lines
Extra Test:
score: 0
Extra Test Passed