#include #include #include int a[100], b[100]; int size; int num; #define min(a,b) ((a)<(b) ? (a) : (b)) #define max(a,b) ((a)>(b) ? (a) : (b)) int main() { scanf("%d", &num); for (int k = 0; k < num; k++) { int suma = 0; scanf("%d", &size); for (int i = 0; i < size; i++) { scanf("%d", &a[i]); suma += a[i]; } int maxkostek = 0; int minkostek; int sumb = 0; for (int i = 0; i < size; i++) { int b; scanf("%d", &b); sumb += b; for (int j = 0; j < size; j++) maxkostek += min(a[j], b); } minkostek = max(suma, sumb); printf("Minimalni budova obsahuje %d kostek, maximalni %d kostek.\n", minkostek, maxkostek); } return 0; }