249372026-02-17 00:08:58pirosmacska10Micimackó (40 pont)cpp17Wrong answer 32/401ms508 KiB
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <string>
#include <cmath>
#include <queue>

using namespace std;
using ll=long long;

const ll INF=LLONG_MAX;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int y, x, k, n;
    cin >> y >> x >> k >> n;
    cout << max(0, k-y) + n-(x-y);
}
SubtaskSumTestVerdictTimeMemory
base32/40
1Accepted0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms360 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms316 KiB
12Wrong answer0/21ms316 KiB
13Accepted2/21ms508 KiB
14Accepted2/21ms348 KiB
15Wrong answer0/21ms500 KiB
16Accepted2/21ms316 KiB
17Accepted2/21ms356 KiB
18Accepted2/21ms316 KiB
19Wrong answer0/21ms316 KiB
20Accepted2/21ms316 KiB
21Accepted2/21ms500 KiB
22Accepted2/21ms316 KiB