PAT A1065 问题求解

【题目】Given three integers A, B and C in [−2​63​​,2​63​​], you are supposed to tell whether A+B>C.

Input Specification:
The first line of the input gives the positive number of test cases, T (≤10). Then T test cases follow, each consists of a single line containing three integers A, B and C, separated by single spaces.

Output Specification:
For each test case, output in one line Case #X: true if A+B>C, or Case #X: false otherwise, where X is the case number (starting from 1).

Sample Input:

3
1 2 3
2 3 4
9223372036854775807 -9223372036854775808 0

Sample Output:

Case #1: false
Case #2: true
Case #3: false

下面是一段完全使用C++的代码，但是过不了最后一个测试点，不知道问题出在哪里，求各位大神帮忙看一下！

#include<iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    
    for(int i=1;i<=n;i++){
        long long a,b,c;
        cin>>a>>b>>c;
        long long res = a+b;
        bool flag;
        if( a>0 && b>0 && res<=0) {
            flag = true; //正溢出
        }else if(a<0 && b<0 && res>=0){
            flag = false;//负溢出
        }else if(res>c){
            flag = true;
        }else{
            flag = false;
        }
        if(flag == true){
            cout<<"Case #"<<i<<": "<<"true"<<endl;
        }else{
             cout<<"Case #"<<i<<": "<<"false"<<endl;
        }
    }
    return 0 ;
}