結果

問題 No.2621 Fee Schedule
ユーザー Be11T_Be11T_
提出日時 2024-02-09 21:21:00
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 2,176 bytes
コンパイル時間 3,679 ms
コンパイル使用メモリ 261,828 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-28 13:18:24
合計ジャッジ時間 4,181 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 9
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
#define bit(n, k) ((n >> k) & 1)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int dx[4] = { -1, 0, 1, 0};
const int dy[4] = { 0, 1, 0, -1};
const int inf = 1e9 + 7;
const ll infll = 1e18;
//const double pi = acos(-1);
using Graph = vector<vector<ll>>;
using REV_PQ = priority_queue<ll, vector<ll>, greater<ll>>;
using PQ = priority_queue<ll>;
const int SIZE = 400010;
ll powll(ll n, ll x) {
// return n ^ x;
ll ret = 1;
rep(i, x) ret *= n;
return ret;
}
ll ceil(ll x, ll m){
if(m < 0) x = -x, m = -m;
if(x >= 0) return (x + m - 1) / m;
else return x / m;
}
ll floor(ll x, ll m){
if(m < 0) x = -x, m = -m;
if(x >= 0) return x / m;
else return (x - m + 1) / m;
}
void OutputYesNo(bool val) {
if (val) cout << "Yes" << endl;
else cout << "No" << endl;
}
void OutputTakahashiAoki(bool val) {
if (val) cout << "Takahashi" << endl;
else cout << "Aoki" << endl;
}
void OutPutInteger(ll x) { cout << x << endl; }
void OutPutString(string x) { cout << x << endl; }
int pop_count(ll n){
int ret = 0;
while(n > 0){
if(n % 2 == 1) ret++;
n /= 2;
}
return ret;
}
bool inrange(ll from, ll to, ll val){
// from <= val <= to true
return from <= val && val <= to;
}
using PAIR_REV_PQ = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;
//typedef atcoder::modint998244353 mint;
//typedef atcoder::modint1000000007 mint;
//typedef modint mint;
//typedef vector<mint> ModintVec;
//typedef vector<Modin
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a, b, c; cin >> a >> b >> c;
cout << min(a * c, b) << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0