题解 | #牛牛的平面向量#

#include <stdio.h>
#include<malloc.h>

int main() {
    int n;
    scanf("%d", &n);
    int** arr = malloc(n * sizeof(int) * 2);
    for (int i = 0; i < n; i++)arr[i] = malloc(2 * sizeof(int));
    int a = 0, b = 0;
    for (int i = 0; i < n; i++) {
        scanf("%d %d", &arr[i][0], &arr[i][1]);
        a += arr[i][0];
        b += arr[i][1];
    }
    printf("%d %d", a, b);
    return 0;
}