POJ 2497 Strategies G++

#include <iostream>
#include <vector>
#include <algorithm>
//谢谢博友程序和翻译   Steve总是赢家 
using namespace std;
int main()
{
	int NUM;
	cin>>NUM;
	vector<int> jg;
	for(int i=0;i<NUM;i++)
	{
		int da,NUM1;
		cin>>da>>NUM1;
		vector<int> a;
		int sum=0;
		for(int j=0;j<NUM1;j++)
		{
			int t; 
			cin>>t;	
			a.push_back(t);	
		}
		sort(a.begin(),a.end());
		int Steve=0;
		int n2=0;
		sum=0;
		for(int j=0;j<NUM1;j++)
		{
			sum=sum+a[j];
			if(sum<=da)
			{
				Steve=sum+Steve;
				n2++;
			}
		}
		jg.push_back(n2);
		jg.push_back(Steve); 
	}
	for(int i=0;i<jg.size();)
	{
		cout<<"Scenario #"<<i/2+1<<":"<<endl;
		cout<<"Steve wins with "<<jg[i]<<" solved problems and a score of ";
		i++;
		cout<<jg[i]<<"."<<endl<<endl;
		i++;
	}
	return 0;
}