81pts求条

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int mod=1e9+7;
const int inf=1e13;
int max(int A,int B){return (A>B)?A:B;}
int min(int A,int B){return (A<B)?A:B;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a*b/gcd(a,b);}
struct node{int t,b;};
bool cmp(node a,node b){
    if(b.b>0) return a.t<b.t;
    else return a.t+a.b>b.t+b.b;
}signed main(){
	ios::sync_with_stdio(0),
	cin.tie(0),cout.tie(0);
	int T;cin>>T;
    while(T--){
        int n,t;cin>>n>>t;
        node a[n];
        for(int i=0;i<n;i++) cin>>a[i].t>>a[i].b;
        sort(a,a+n,cmp);
        for(int i=0;i<n;i++) t+=a[i].b;
        if(t>0) cout<<"+1s\n";
        else cout<<"-1s\n";
    }
	return 0;
}