QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#669619 | #9423. Gold Medal | DangX | AC ✓ | 0ms | 3668kb | C++20 | 691b | 2024-10-23 19:11:25 | 2024-10-23 19:11:25 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 110;
int a[N],b[N];
bool cmp(int a,int b) {return a>b;}
void solve()
{
int n,k;cin>>n>>k;
int ans = 0;
for(int i = 1;i<=n;i++)
{
cin>>a[i];
ans += a[i]/k;
b[i] = a[i]%k;
b[i] -= k;
}
int m;cin>>m;
sort(b+1,b+1+n,cmp);
//for(int i = 1;i<=n;i++) cout<<b[i]<<" ";
for(int i = 1;i<=n;i++)
{
if(b[i] == -k) continue;
if(m >= -b[i])
{
m += b[i];
ans ++;
}
}
if(m)
{
ans += m/k;
}
cout<<ans<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int t;cin>>t;
while(t--) solve();
return 0;
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3668kb
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: 0ms
memory: 3596kb
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