Submission #3666387

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = INF+7;
const ll LINF = 1e18;
#define rep(i,N) for(int (i)=0;(i)<(N);++(i))
#define rrep(i,N) for(int (i)=(N-1);(i)>0;--i)
#define FOR(i,j,N) for(int (i)=(j);(i)<(N);++(i))
#define put(n) cout<<(n)<<endl;
#define VI vector<int>
#define VII vector<vector<int>>
#define all(v) v.begin(),v.end()
#define MP make_pair
#define pb(n) push_back(n)

int main(){
    int T,A,B,C,D;
    cin >> T >> A >> B >> C >> D;
    
    if(A+C <= T) cout << B+D << endl;
    else if(C <= T) cout << D << endl;
    else if(A <= T) cout << B << endl;
    else cout << 0 << endl;
}

Submission Info

Judge Result