QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#602504 | #9423. Gold Medal | leo2005 | WA | 2ms | 3596kb | C++14 | 695b | 2024-10-01 09:06:57 | 2024-10-01 09:06:59 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int T;
const int maxn=105;
int a[maxn];
int main(){
cin>>T;
while (T--)
{
long long temp=0;
long long ans=0;
int n,k,m;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
}
cin>>m;
for(int i=1;i<=n;i++){
ans+=a[i]/k;
a[i]=a[i]%k;
}
sort(a+1,a+1+n);
int i=n;
while(m-(k-a[i])>0){
if(i>=1){
m-=k-a[i];
i--;
ans++;
}else{
ans+=m;
m=0;
}
}
cout<<ans<<endl;
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3596kb
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: 2ms
memory: 3560kb
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:
2969433 5390 65 0 66483180 44507 54 0 166519302 76709 114876519 0 195664947 1551991442 191573 19426 0 35644 4 266 34841131 739538991 9 11 0 51560851 2 262191 175 6286240838 0 1045 293089 167116 4 141328 457999561 86260076 14 1963 11 491358 163 8970 3869760302 14427927 31849 35360326 133717 6261 99 4...
result:
wrong answer 1st lines differ - expected: '2734453', found: '2969433'