江西理工2019 摸底测试题解

#include<bits/stdc++.h>
#include<vector>
#include<map>
#include<queue>
#define LL long long
#define INF 0x3f3f3f3f
#define MOD 1000000007
using namespace std;
LL a[100005], b[100005], ans[100005];
int main()
{
    LL t, n, m, x, y;
    scanf("%lld", &t);
    while(t--)
    {
        scanf("%lld%lld", &n, &m);
        for(int i = 1;i <= n;i++)
        {
            scanf("%lld", &a[i]);
            b[i] = 0;
        }
        for(int i = 1;i <= m;i++)
        {
            scanf("%lld%lld", &x, &y);
            b[x] += y;
        }
        for(int i = 1;i <= n;i++)
        {
            if(b[i] >= a[i])
            {
                ans[i] = a[i];
                b[i] -= a[i];
                //printf("ai = %d\n", a[i]);
                //printf("ansi = %d\n", ans[i]);
                b[i+1] += b[i];
            }
            else
            {
                ans[i] = b[i];
                b[i] = 0;
            }
        }
        for(int i = 1;i <= n;i++)
        {
            if(i < n)
                printf("%lld ", ans[i]);
            else
                printf("%lld\n", ans[i]);
        }
    }
    return 0;
}