Submission #667636

#	Time	Username	Problem	Language	Result	Execution time	Memory
667636		LFFB	Table Tennis (info1cup20_tabletennis)	C++14	0 / 100	32 ms	2336 KiB

tabletennis

#include <iostream>
#include <algorithm>

#define debug(args...) //printf(args)

const int MAX_M = 16e4;
typedef long long llong;

int n, m, k;
int input[MAX_M];
llong sum;

int main() {

    scanf("%d %d", &n, &k);
    if (k != 1) return 1;
    m = n + k;
    for (int i = 0; i < m; i++) {
        scanf("%d", &input[i]);
        sum += input[i];
    }

    int bad = -1;

    for (int i = 0; i < m; i++) {
        sum -= input[i];
        if (sum % (n / 2) == 0) {
            debug("%d is bad\n", i);
            bad = input[i];
        }

        sum += input[i];
    }

    std::sort(input, input+m);

    for (int i = 0; i < m; i++) {
        if (input[i] == bad) continue;
        printf("%d ", input[i]);
    }
    printf("\n");

}

Compilation message (stderr)

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
tabletennis.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         scanf("%d", &input[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13