leetcode-go/written-exam/kickstart-2019-D/no3/main.cc

#include <cstdio>

#define N 100000

int X[N];
int C[N];

int main() {
    int T;
    scanf("%d", &T);
    for (int t = 1; t <= T; t++) {
        int k, n;
        scanf("%d %d", &k, &n);
        for (int i = 0; i < n; i++) scanf("%d", &X[i]);
        for (int i = 0; i < n; i++) scanf("%d", &C[i]);
        printf("Case #%d: \n", t);
    }
    return 0;
}