UVA-1445 Cubist Artwork

The main topic: give an irregular graph of the front and left view, ask how many small cubes to use.

Thinking: It's easy to think that if the front and left views have a column that is exactly the same height, you can omit one column.

#include <cstdio>#include <algorithm>using namespace STD;intMain () {intW, D; while(scanf("%d%d", &w, &d) && W + d) {intH, f[ -] = {0}, s[ -] = {0}; for(inti =0; i < W; i++) {scanf("%d", &h);        f[h]++; } for(inti =0; I < D; i++) {scanf("%d", &h);        s[h]++; }intAns =0; for(inti =1; I <= -; i++) ans + = max (F[i], s[i]) * i;printf("%d\n", ans); }return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

UVA-1445 Cubist Artwork