20220317-56

Author: mok0102

11728

@@ -0,0 +1,36 @@
+#include <cstdio>
+
+
+int main(){
+    long long int as, bs;
+    scanf("%lld %lld", &as, &bs);
+
+    long long a[as], b[bs];
+    for(long long int i=0;i<as;i++) scanf("%lld", &a[i]);
+    for(long long int i=0;i<bs;i++) scanf("%lld", &b[i]);
+
+    long long int c[as+bs];
+    long long int ap=0, bp=0;
+
+    while(ap<as || bp<bs){
+        if(ap==as){
+            c[ap+bp]=b[bp];
+            bp++;
+        }
+        else if(bp==bs){
+            c[ap+bp]=a[ap];
+            ap++;
+        }
+
+        else if(a[ap]<b[bp]){
+            c[ap+bp]=a[ap];
+            ap++;
+        }
+        else{
+            c[ap+bp]=b[bp];
+            bp++;
+        }
+    }
+    
+    for(long long int i=0;i<as+bs;i++) printf("%lld ", c[i]);
+}

11728.cpp

@@ -0,0 +1,26 @@
+#include <cstdio>
+#include <algorithm>
+using namespace std;
+
+int n;
+int t[15000001];
+int p[15000001];
+int dp[15000001];
+
+int main(){
+    scanf("%d", &n);
+    for(int i=0;i<n;i++){
+        scanf("%d%d", &t[i], &p[i]);
+        dp[i]=0;
+    }
+    dp[n]=0;
+
+    for(int i=n-1;i>=0;i--){
+        if(i+t[i]>n) dp[i]=dp[i+1];
+        else{
+            dp[i]=max(dp[i+t[i]]+p[i], dp[i+1]); // 그날 업무 하는 거랑 안하는 것 중에 큰 것 고르기.
+        }
+    }
+
+    printf("%d\n", dp[0]);
+}