Doing Homework again

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string.h>
using namespace std;

typedef struct DDL{
    int day;
    int score;
    int flag=0;
}DDL;

bool cmp(DDL obj1,DDL obj2){
    if(obj1.score==obj2.score)
        return obj1.day<obj2.day;
    return obj1.score>obj2.score;
}

int main(int argc, const char * argv[]) {
    int T;
    while (scanf("%d",&T)!=EOF) {
        for(int i=0;i<T;i++){
            DDL a[1005];
            int b[1005];
            memset(b, 0, 1005);
            int n;
            int sum=0;
            scanf("%d",&n);
            for(int j=0;j<n;j++)
                scanf("%d",&a[j].day);
            for(int j=0;j<n;j++)
                scanf("%d",&a[j].score);
            sort(a, a+n, cmp);
            for(int j=0;j<n;j++)
            {
                for(int k=a[j].day;k>0;k--)
                if(b[k]==0){
                        b[k]=1;
                        a[j].flag=1;
                        break;
                    }
            }
            for(int k=0;k<n;k++)
                if(a[k].flag==0)
                    sum=sum+a[k].score;
            printf("%d\n",sum);
        }
    }
    return 0;
}