QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #404788 | #7622. Yet Another Coffee | sw7777 | WA | 0ms | 6792kb | C++14 | 643b | 2024-05-04 18:34:45 | 2024-05-04 18:34:46 |
Judging History
answer
#include <iostream>
#include <algorithm>
using namespace std;
#define int long long
void solve(){
int a[210000];
int dp[210000];
int n,m;cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
dp[1]=1;
for(int i=2;i<=n;i++){
if(a[dp[i-1]]>a[i]) dp[i]=i;
else dp[i]=dp[i-1];
}
for(int i=1;i<=m;i++){
int x,y;cin>>x>>y;
a[dp[x]]-=y;
}
sort(a+1,a+1+n);
int ans=0;
for(int i=1;i<=n;i++){
ans+=a[i];
cout<<ans<<" ";
}cout<<endl;
}
signed main(){
int t;cin>>t;
while(t--){
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 6792kb
input:
5 10 14 17 37 59 65 53 73 68 177 160 111 10 177 5 193 2 30 3 63 2 339 3 263 5 178 2 190 9 23 10 328 10 200 9 8 3 391 6 230 12 9 152 306 86 88 324 59 18 14 42 260 304 55 3 50 2 170 1 252 7 811 1 713 7 215 10 201 4 926 8 319 19 20 182 74 180 201 326 243 195 31 170 263 284 233 48 166 272 281 179 116 31...
output:
-2596 -2559 -2506 -2447 -2382 -2314 -2241 -2130 -1970 -1793 -1008 -1991 -2881 -3387 -3345 -3290 -3231 -3143 -2883 -2579 -2273 -1949 -4500 -6315 -6422 -6374 -6258 -6092 -5922 -5743 -5563 -5368 -5167 -4934 -4691 -4428 -4156 -3875 -3591 -3272 -2946 -1792 -2804 -2572 -2140 -1707 -1238 -768 -274 243 1...
result:
wrong answer 11th numbers differ - expected: '-3505', found: '-1008'