Mine

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <climits>
#include <cmath>

using namespace std;

int main() {

	int N, S, R, G;
	char dummy;

	cin >> N;

	for(int i = 0; i < N; ++i)
	{
		cin >> S >> R >> G;
		vector<int> points;
		for(int student = 0; student < S; ++student)
		{
			int temp;
			cin >> temp;
			points.push_back(temp);
		}

		for(int revision = 0; revision < R; ++revision)
		{
			int idx, number;
			cin >> dummy >> idx >> number;
			points[idx-1] += number;
		}

		int bestScore = 0;
		for(int group = 0; group < G; ++group)
		{
			int start, end;
			cin >> dummy >> start >> end;
			int currentSum = 0;
			for(int idx = start-1; idx < end; ++idx)
			{
				currentSum += points[idx];
			}
			if(currentSum > bestScore)
			{
				bestScore = currentSum;
			}
		}

		cout << bestScore;
	}
	
	return 0;
}