Submission #1983336
Source Code Expand
#include <bits/stdc++.h> #define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++) #define REP(i,n) FOR(i,0,n) #define RER(i,n) FOR(i,0,(n+1)) #define pb push_back #define mp(a,b) make_pair((a),(b)) #define mset(m,v) memset(m,v,sizeof(m)) using namespace std; typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll; typedef vector<ll> vl; typedef pair<ll,ll> pll; typedef vector<pair<ll, ll> > vpll; typedef vector<string> vs; typedef long double ld; const double EPS = 1e-10; const int INF = 1e+9; const double PI = acos(-1); auto main() -> int { int n, k, x, y; cin >> n >> k >> x >> y; cout << min(n, k) * x + max(n-k, 0) * y << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Tak and Hotels (ABC Edit) |
User | kagemiku |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 786 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example_01.txt, example_02.txt |
All | example_01.txt, example_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_01.txt | AC | 1 ms | 256 KB |
example_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |