Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017) - A. Arpa and a research in Mexican wave

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <cstdio>
#include <cmath>
#include <queue>
#include <cstring>
#include <cmath>
#include <string>
#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
 
int main()
{
    int n, k, t;
    cin >> n >> k >> t;
 
    int sol = 0;
    if (k >= t) {
        sol = t;
    }
    else if(n >= t) {
        sol = k;
    }
    else if(n <t ) {
        sol = k - (t - n);
    }
 
    cout << sol << endl;
    return 0;
}