QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #320338 | #7622. Yet Another Coffee | ushg8877# | WA | 1ms | 3744kb | C++20 | 674b | 2024-02-03 15:58:45 | 2024-02-03 15:58:45 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
mt19937 rnd(time(0));
const int MAXN=2e5+5;
int n,m;
ll a[MAXN];
struct tickit{int x,y;}b[MAXN];
void solve(){
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=m;i++) cin>>b[i].x>>b[i].y;
sort(b+1,b+m+1,[&](tickit x,tickit y){return x.x<y.x;});
int p=1,r=1;
for(int i=1;i<=n;i++){
while(r<b[i].x){
r++;
p=(a[p]<a[r]?p:r);
}
a[p]-=b[i].y;
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++){
a[i]+=a[i-1];
cout<<a[i]<<' ';
}
cout<<endl;
}
int main(){
ios::sync_with_stdio(false);
int _;cin>>_;
while(_--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3744kb
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:
-1883 -1846 -1793 -1734 -1669 -1601 -1528 -1417 -1257 -1080 -3713 -3699 -3681 -3639 -3584 -3525 -3439 -3351 -3091 -2787 -2481 -2157 -5974 -5943 -5895 -5821 -5705 -5539 -5369 -5190 -5010 -4815 -4614 -4381 -4138 -3875 -3603 -3322 -3038 -2719 -2393 -3219 -2987 -2572 -2140 -1707 -1238 -768 -274 243 1...
result:
wrong answer 1st numbers differ - expected: '-2596', found: '-1883'