QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#415982 | #8723. 乘二 | SocialPanda | WA | 143ms | 4176kb | C++14 | 491b | 2024-05-21 13:30:14 | 2024-05-21 13:30:15 |
Judging History
answer
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
//#define int long long
int mod=1e9+7;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,k;
int ans=0;
cin>>n>>k;
priority_queue<int,vector<int>,greater<int>> q;
for(int i=1;i<=n;i++)
{
int a;
cin>>a;
ans+=a;
q.push(a);
}
while(k--)
{
int num=q.top();
ans+=num;
q.pop();
q.push(num*2);
}
cout<<ans<<endl;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3852kb
input:
3 3 7 2 1
output:
15
result:
ok 1 number(s): "15"
Test #2:
score: -100
Wrong Answer
time: 143ms
memory: 4176kb
input:
200000 1605067 366760624 67854 93901 693975 27016 1046 10808 6533158 54778 500941023 77236442 32173 10431454 2 9726 1553148 89282 411182309 494073 131299543 249904771 7906930 353 9909 3632698 29156 1917186 303 737 1189004 22 1983 263 711 4106258 2070 36704 12524642 5192 123 2061 22887 66 380 1 10153...
output:
1540506044
result:
wrong answer 1st numbers differ - expected: '707034173', found: '1540506044'