結果

問題 No.2621 Fee Schedule
ユーザー naimonon77naimonon77
提出日時 2024-04-07 16:57:47
言語 C++17(clang)
(17.0.6 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 2,375 bytes
コンパイル時間 1,976 ms
コンパイル使用メモリ 163,508 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-10-01 04:34:55
合計ジャッジ時間 2,416 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 9
権限があれば一括ダウンロードができます

ソースコード

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

#define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <regex>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rep2(i,a,n) for(int i=a;i<(int)(n);++i)
#define rrep(i,n) for(int i=(n)-1;i>=0;--i)
#define reu(i,n) for(int i=1;i<=(int)(n);++i)
#define chmax(a,b) (a=(a)<(b)?(b):(a))
#define chmin(a,b) (a=(a)>(b)?(b):(a))
using ll = long long;
#define all(a) begin(a),end(a)
#define int long long
#ifdef LOCAL_ENV
#define dump(x) cerr<<#x<<" : "<<(x)<< " \t"
#define dumpl(x) dump(x)<<endl
#define cerr_endl cerr<<endl
ofstream ofstream1("out.txt");
#define cout ofstream1
#else
#define dump(x)
#define dumpl(x)
#define cerr_endl
#endif
#define abp(o,a,b) cout<<(((o)?a:b))<<endl
#define YEP(x) abp(x,"YES","NO")
#define Yep(x) abp(x,"Yes","No")
const int inf = (int)1 << 60;
ll mod_n = (int)1e9 + 7;
const int MAX = (int)2e6 + 5;
const int MAX2 = 2005;
template<typename T>void ce_vector(vector<T> a) {
#ifdef LOCAL_ENV
rep(i, a.size() - 1) cerr << a[i] << " "; cerr << a[a.size() - 1] << endl;
#endif
}
template<typename T>void ce_vector(vector<pair<T, T>> a) {
#ifdef LOCAL_ENV
rep(i, a.size()) cerr << a[i].first << "," << a[i].second << " "; cerr << endl;
#endif
}
template<typename T>void o_vector(vector<T> a) {
if (a.size() == 0) { cout << endl; return; }
rep(i, a.size() - 1) cout << a[i] << " "; cout << a[a.size() - 1] << endl;
}
template<typename T>void o_vector(vector<pair<T, T>> a) { rep(i, a.size()) cout << a[i].first << "," << a[i].second << " "; cout << endl; }
ll pow_n(ll x, ll n) { ll r = 1; while (n > 0) { if (n & 1)r = (r * x) % mod_n; x = (x * x) % mod_n; n >>= 1; }return r; }
template<typename T>
vector<T> in_vec(int n) {
vector<T> a(n);
a.resize(n);
rep(i, n) cin >> a[i];
return a;
}
int div_ceil(int a, int b) { int r = a / b; if (a % b != 0)r++; return r; }
ll modular(ll x) {
return ((x % mod_n + mod_n) % mod_n);
}
// end of template
struct Solver {
void solve() {
int a, b, c; cin >> a >> b >> c;
cout << min(b, a * c) << endl;
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(2);
Solver().solve();
#ifdef LOCAL_ENV
cout << endl;
cerr << endl << "\x1b[7m ↓ \x1b[0m" << endl;
system("type out.txt");
#endif
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0