UVA 13007- D as in Daedalus

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, m, i, j;
    int arr[5]={1,10, 100, 1000, 10000};
    while(scanf("%d %d", &n, &m)!=EOF) {
        int ans=0;
        for(i=0; i<m; i++) {
            long int budget, daed, input, sum=0;
            scanf("%ld %ld", &budget, &daed);
            sum=daed;
            for(j=1; j<n; j++) {
                scanf("%d", &input);
                sum+=input;
            }
            if(sum<=budget) {
                for(j=4; j>=0; j--) {
                    if(sum-daed+arr[j]<=budget) {
                        ans+=arr[j];
                        ans-=daed;
                        break;
                    }
                }
            }
            else {
                for(j=4; j>=0; j--) {
                    if(sum-daed+arr[j]<=budget) {
                        ans+=arr[j];
                        break;
                    }
                }
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}