QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#744103 | #9528. New Energy Vehicle | Andy | WA | 0ms | 3716kb | C++14 | 682b | 2024-11-13 20:52:55 | 2024-11-13 20:53:01 |
Judging History
answer
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
void solve();
int main(){
ios::sync_with_stdio(false);
int T=1;
cin>>T;
while(T--){
solve();
}
return 0;
}
#define int long long
const int N=1e5+5,M=1e5+5;
int n,m,a[N];
int x[M],t[M];
void solve(){
cin>>n>>m;
ll E=0;
for(int i=1;i<=n;i++){
cin>>a[i];
E+=a[i];
}
for(int i=1;i<=m;i++) cin>>x[i]>>t[i];
ll now=0;
for(int i=1;i<=m;i++){
if(E<x[i]){
cout<<E<<endl;
return ;
}
ll v=min(x[i]-now,a[t[i]]);
now+=v,E+=v;
}
cout<<E<<endl;
return ;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3716kb
input:
2 3 1 3 3 3 8 1 2 2 5 2 1 2 2 1
output:
12 9
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3584kb
input:
6 3 2 2 2 2 6 1 7 1 2 2 3 3 2 1 6 2 2 3 2 2 5 1 7 2 9 1 2 2 3 3 2 1 6 2 1 1 999999999 1000000000 1 1 1 1000000000 1000000000 1
output:
10 11 4 11 999999999 2000000000
result:
wrong answer 1st lines differ - expected: '9', found: '10'