Bill Division - HackerRank || HackerRank Bill Division Solution

#include <stdio.h>

int main()
{
    int n, k, bill, i, sum = 0, refund;
    scanf("%d %d", &n, &k);
    int array[n];
    for (i = 0; i < n; i++)
    {
        scanf("%d", &array[i]);
        sum = sum + array[i];
    }
    scanf("%d", &bill);
    if (((sum - array[k]) / 2) == bill) printf("Bon Appetit\n");
    else
    {
        refund = bill - ((sum - array[k]) / 2);
        printf("%d\n", refund);
    }

    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, k, bill, i, sum = 0, refund;
    cin >> n >> k;
    int array[n];
    for (i = 0; i < n; i++)
    {
        cin >> array[i];
        sum = sum + array[i];
    }
    cin >> bill;
    int actual_bill = (sum - array[k]) / 2;
    if (bill == actual_bill) cout << "Bon Appetit" << endl;
    else
    {
        refund = bill - actual_bill;
        cout << refund << endl;
    }

    return 0;
}

import java.util.Scanner;

public class Bon_Appetit {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int k = input.nextInt();
        int[] array = new int[n];
        int sum = 0;
        for (int i = 0; i < n; i++) {
            array[i] = input.nextInt();
            sum = sum + array[i];
        }
        int b = input.nextInt();
        int actual_bill = (sum - array[k]) / 2;
        int bill_difference = b - actual_bill;
        if ( actual_bill == b) System.out.println("Bon Appetit");
        else System.out.println(bill_difference);
    }
}