Bon Appétit

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
 
using namespace std;
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    
    int n;
    int k;
    cin >> n >> k;
    vector<int> arr(n);
    
    for(int i =0; i<n; i++) {
        cin >> arr[i];
    }
    
    int d; cin>> d;
    
    int sum = 0;
    for(int i =0; i<n; i++) {
        if(i == k) {
            continue;
        }
        sum = sum + arr[i];
    }
    
    int cand = sum / 2;
    
    int actual = d - cand;
    if(actual == 0) {
        cout << "Bon Appetit";
    } else {
        cout << actual;
    }
    
    return 0;
}