diff --git a/1025. Fashion Shows C++ Code.cpp b/1025. Fashion Shows C++ Code.cpp new file mode 100644 index 0000000..b98bb69 --- /dev/null +++ b/1025. Fashion Shows C++ Code.cpp @@ -0,0 +1,41 @@ +#include +#include +#include +using namespace std; + +int main() +{ + int soma, n, t, temp, input; + vector levelsman, levelswoman; + cin >> t; + + while(t-- > 0) + { + cin >> n; + temp = n; + while(temp-- > 0) + { + cin >> input; + levelsman.push_back(input); + } + temp = n; + while(temp-- > 0) + { + cin >> input; + levelswoman.push_back(input); + } + sort(levelswoman.begin(), levelswoman.end()); + sort(levelsman.begin(), levelsman.end()); + + soma = 0; + for(int i = 0; i < n; i++) + { + soma += levelsman[i]*levelswoman[i]; + } + + cout << soma << "\n"; + levelsman.clear(); + levelswoman.clear(); + } + return 0; +} \ No newline at end of file diff --git a/ACPC10D.cpp b/ACPC10D.cpp new file mode 100644 index 0000000..9c0e5a0 --- /dev/null +++ b/ACPC10D.cpp @@ -0,0 +1,36 @@ +/* +USER: zobayer +TASK: ACPC10D +ALGO: dynamic programming +*/ + +#include + +const int inf = 0x7f7f7f7f; +int tri[100000][3]; + +inline int min(int a, int b) { + return a < b ? a : b; +} + +int main() { + int n, i, j, a, b, c, d, cs = 1; + while(scanf("%d", &n)==1 && n) { + for(i = 0; i < n; i++) + for(j = 0; j < 3; j++) + scanf("%d", &tri[i][j]); + tri[0][0] = inf; + tri[0][2] += tri[0][1]; + for(i = 1; i < n; i++) { + for(j = 0; j < 3; j++) { + a = (j==2)? inf : tri[i-1][j+1]; + b = tri[i-1][j]; + c = (j==0)? inf : tri[i-1][j-1]; + d = (j==0)? inf : tri[i][j-1]; + tri[i][j] += min(min(a, b), min(c, d)); + } + } + printf("%d. %d\n", cs++, tri[n-1][1]); + } + return 0; +} \ No newline at end of file