Submission #3430370
Source Code Expand
//include //------------------------------------------ #include <vector> #include <list> #include <map> #include <climits> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> #include <queue> #include <random> #include <cctype> #include <complex> #include <regex> using namespace std; #define C_MAX(a, b) ((a)>(b)?(a):(b)) #define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";} #define SHOW_MAP(v) {std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}} int main() { long long N, H; cin >> N >> H; vector<long long> a(N), b(N); for (int i = 0; i < N; i++) cin >> a[i] >> b[i]; long long maxA = *max_element(a.begin(), a.end()); priority_queue<long long> Q; for (int i = 0; i < N; i++) if (b[i] > maxA) Q.push(b[i]); int ans = 0; while (!Q.empty()) { long long d = Q.top(); Q.pop(); if (H <= 0) break; H -= d; ans++; } ans += max(0LL, H) / maxA; if (max(0LL, H) % maxA) ans++; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Katana Thrower |
User | ganyariya |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1526 Byte |
Status | AC |
Exec Time | 86 ms |
Memory | 2936 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03, a04 |
All | a01, a02, a03, a04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23, b24 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
a03 | AC | 1 ms | 256 KB |
a04 | AC | 1 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 86 ms | 1792 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 86 ms | 1792 KB |
b09 | AC | 1 ms | 256 KB |
b10 | AC | 1 ms | 256 KB |
b11 | AC | 1 ms | 256 KB |
b12 | AC | 1 ms | 256 KB |
b13 | AC | 36 ms | 2936 KB |
b14 | AC | 35 ms | 2936 KB |
b15 | AC | 32 ms | 1792 KB |
b16 | AC | 33 ms | 1792 KB |
b17 | AC | 49 ms | 1792 KB |
b18 | AC | 44 ms | 1792 KB |
b19 | AC | 45 ms | 2936 KB |
b20 | AC | 47 ms | 2936 KB |
b21 | AC | 56 ms | 2936 KB |
b22 | AC | 61 ms | 2936 KB |
b23 | AC | 1 ms | 256 KB |
b24 | AC | 2 ms | 256 KB |