This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
int DeletePlan( int N, int M, int K, int *A, int *B) {
int i, sz = 0;
for(i = 0; i < N; i++) if(A[i] == 1) ++sz;
if(N == K) return 1;
else if(sz <= K) return K - sz + 1;
return K;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |