Submission #3663550

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

typedef long long lint;
typedef pair<int, int> P;
#define REP(i, x, n) for(int i = x ; i < n ; ++i)
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for(int i = n - 1 ; i >= 0 ; --i)
#define SORT(c) sort((c).begin(), (c).end())

const int IINF = 1e9 + 10;
const lint LLINF = (lint)1e18 + 10;
const lint MOD = (lint)1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};

int main(){
    lint 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;
    }
    return 0;
}

Submission Info

Judge Result