/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 2ms 508.0 KiB
#5 Accepted 5ms 532.0 KiB
#6 Accepted 39ms 1.27 MiB
#7 Accepted 39ms 1.312 MiB
#8 Accepted 45ms 1.27 MiB
#9 Accepted 35ms 1.332 MiB
#10 Accepted 3ms 324.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define vv vector<long long>
#define mpp map<long long,long long>
#define ss set<long long>
#define vp vector<pair<long long, long long>>
#define MOD 1000000007
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define all_v v.begin(),v.end()
#define all_a a.begin(),a.end()
#define all_n for(int i=0;i<n;i++)
void requisite(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
}
int main() {
    requisite();
    ll t;
    cin>>t;
    while (t--){
        ll n,d;cin>>n>>d;
        ll a,b;cin>>a>>b;
        ll x=0;
        ll y=0;
        if (d>=n){
            cout<<n*a<<endl;
            continue;
        }
        else {
            x = d * a;
            y = b * (n - d);
        }
        cout<<x+y<<endl;
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1090 Summer trip
Contest
Brain Booster #5
Language
C++17 (G++ 13.2.0)
Submit At
2024-09-05 15:40:49
Judged At
2024-09-05 15:40:49
Judged By
Score
100
Total Time
45ms
Peak Memory
1.332 MiB