题目描述
解题思路
参考代码
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int T;
scanf("%d",&T);
while (T--){
int n,m,tmp,a,b;
scanf("%d %d",&n,&m);
vector<int> v;
for (int i = 0;i < n;i++){
scanf("%d",&tmp);
v.push_back(tmp);
}
for (int i = 0;i < m;i++){
scanf("%d %d",&a,&b);
if (a == 0) continue;
else if (a > 0) v[b-1] *= 2;
else if (a < 0) v[b-1] += 2;
}
sort(v.begin(),v.end());
printf("%d\n",v[n-1]);
}
return 0;
}