QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#627023 | #9423. Gold Medal | dnyh# | WA | 0ms | 5712kb | C++23 | 790b | 2024-10-10 14:29:44 | 2024-10-10 14:29:44 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef std::pair<int,int>pii;
#define N 300100
int a[N],b[N];
int t;
void solve(){
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
}
int m;
cin>>m;
if(k==1){
int ans=m;
for(int i=1;i<=n;i++) ans+=a[i];
cout<<ans<<endl;
return ;
}
int res=0;
for(int i=1;i<=n;i++) res+=(a[i]/k),b[i]=a[i]%k;
sort(b+1,b+1+n);
reverse(b+1,b+1+n);
for(int i=1;i<=n;i++){
if(b[i]+m<k||m<0) break;
res++;
m-=k-b[i];
}
cout<<res<<endl;
}
signed main(){
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cin>>t;
while(t--){
solve();
}
return 0 ;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 5712kb
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: 0ms
memory: 5676kb
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:
2731753 5390 65 0 66483181 44507 54 0 166361093 76709 114876519 0 12551 1385653131 12521 19426 0 35644 4 266 34841131 729853752 9 11 0 51507895 2 262191 175 6286240839 0 1045 293089 167116 4 141328 454670535 86184211 14 1963 11 491358 163 8970 3869760302 14424300 31849 542569 133717 6261 99 11391 23...
result:
wrong answer 1st lines differ - expected: '2734453', found: '2731753'