CP_31_TLE_RATED_1100/C_Quests.cpp at main · shivNcode/CP_31_TLE_RATED_1100 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rep(i, a, b) for (int i = a; i < b; i++)
#define ll long long
void solve() {

}

int main() {
    fastio;

    int t;
    cin >> t;
    while (t--) {
        ll n , k;
        cin>>n>>k;
        vector<ll> arr(n) , brr(n);
        for(ll i=0;i<n;i++) cin>>arr[i];
        for(ll i=0;i<n;i++) cin>>brr[i];
        ll bmax = 0;
        ll ans = 0;
        ll value = 0;
        ll asum = 0;
        for(ll i=0;i<min(n , k);i++){
            bmax = max(bmax , brr[i]);
            asum+=arr[i];
            value = asum + (bmax * (k-i-1));
            ans = max(value , ans);
        }
        cout<<ans<<endl;
    }

    return 0;
}


/*
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rep(i, a, b) for (int i = a; i < b; i++)

void solve() {

}

int main() {
    fastio;

    int t;
    cin >> t;
    while (t--) {
        int n , k;
        cin>>n>>k;
        vector<int> arr(n) , brr(n);
        int orisum = 0;
        for(int i=0;i<n;i++){
            cin>>arr[i];
            if(i<=k-1) orisum+=arr[i];
        }
        for(int i=0;i<n;i++){
            cin>>brr[i];
        }
        int ans = orisum;
       if(k<=n){
         //cout<<orisum<<endl;
        for(int i=0;i<k-1;i++){
            int temp = orisum;
            int sum = orisum;
            //cout<<"for "<<brr[i]<<" ";
            for(int j = k-1;j>i;j--){
                //cout<<"add "<<brr[i]<<" romove "<<arr[j]<<" ";
                temp-=arr[j];
                temp+=brr[i];
                //cout<<temp<<endl;
                sum = max(sum , temp);
            }
            // cout<<"answer ";
            ans = max(ans , sum);
            //cout<<ans<<endl;

        }
         cout<<ans<<endl;
       }
       else{
            // cout<<orisum<<endl;
            int ans = orisum;
            int x = k - n;
            //cout<<x<<endl;
            for(int i=0;i<n;i++){
                int temp = orisum + (x*brr[i]);
                int sum = orisum + (x*brr[i]);
                for(int j = n-1;j>i;j--){
                    temp-=arr[j];
                    temp+=brr[i];
                    sum = max(sum , temp);
                }
                ans = max(ans , sum);
            }
            cout<<ans<<endl;
       }


    }

    return 0;
}


*/