雷霆战机

雷霆战机

#include <stdio.h>
#include <iostream>
#include <stdlib.h>
using namespace std;
int cmd(const void *a, const void *b) {
return (*(int*)a-*(int*)b);
}
int main() {
int n;
while(scanf("%d", &n) != EOF) {
long long int b[10000];
long long int a[4];
for(int i = 0; i < 4; i++) {
scanf("%lld", &a[i]);
}
for(int i = 0; i < n; i++) {
scanf("%lld", &b[i]);
}
qsort(b,n,sizeof(long long int),cmd);
int max = n - 1;
int p;
for(int i = 0; i < 4;) {
int s = 0;
if(b[max] == 0)
break;
for(int j = 0; j < n; j++){
if(b[max] == 0) {
i--;
break;
}
if(s + b[j] >= a[i]) {
b[j] = 0;
s = 0;
if(j == max) {
for(int z = max;z >= 0;z--) {
if(b[z] != 0) {
max = z;
break;
}
}
}
break;
}
else if(j == max) {
s = s + b[max];
j = -1;
b[max] = 0;
for(int z = max; z >= 0; z--) {
if(b[z] != 0) {
max = z;
break;
}
}
}
}
i++;
p = i;
}
if(p == 4) {
long long int sum = 0;
for(int i = 0; i < n; i++)
sum = sum + b[i];
printf("YES %lld\n", sum);
}
else
printf("NO\n");
}
return 0;
}