iiitv/ChefLib

View on GitHub
2017/MAR/MARCH17/XENTASK/XENTASK.c

Summary

Maintainability
Test Coverage
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// ~~~~~~~© Aashutosh Rathi~~~~~~
// ~~~~~~~~aashutosh001~~~~~~~~~~
//~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>

typedef long long int lli;
typedef long int BIG;
#define mod(x) x%1000000007;
#define MIN( n1, n2 )    ((n1) > (n2) ? (n2) : (n1))
#define MAX( n1, n2 )    ((n1) > (n2) ? (n1) : (n2))


int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        BIG n,i,j;
        scanf("%ld",&n);
        BIG x[n],y[n];
        for(i=0;i<n;i++){
            scanf("%ld",&x[i]);
        }
        for(j=0;j<n;j++){
            scanf("%ld",&y[j]);
        }
        BIG p1 = 0 ,p2 = 0;
        for(i=0;i<n;i++){
            if(i%2 == 0){
                p1 = p1 + x[i];
                p2 = p2 + y[i];
            }
            else{
                p1 = p1 + y[i];
                p2 = p2 + x[i];
            }
        }
        printf("%ld\n",MIN(p1,p2));
    }
    return 0;
}