Submission #1948025
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <string> #include <set> #include <map> #include <queue> using namespace std; int main() { int n; long long h; cin >> n >> h; vector<long long> a(n), b(n); long long max_a = 0; for (int i = 0; i < n; i++) { cin >> a[i] >> b[i]; max_a = max(max_a, a[i]); } sort(b.begin(), b.end()); int ans = 0; for (int i = n - 1; i >= 0 && h > 0; i--) { if (b[i] >= max_a) { h -= b[i]; ans++; } } ans += max(0LL, (h + max_a - 1) / max_a); cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Katana Thrower |
User | pekempey |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 607 Byte |
Status | AC |
Exec Time | 88 ms |
Memory | 1792 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 | 88 ms | 1792 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 87 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 | 33 ms | 1792 KB |
b14 | AC | 33 ms | 1792 KB |
b15 | AC | 34 ms | 1792 KB |
b16 | AC | 33 ms | 1792 KB |
b17 | AC | 55 ms | 1792 KB |
b18 | AC | 48 ms | 1792 KB |
b19 | AC | 40 ms | 1792 KB |
b20 | AC | 45 ms | 1792 KB |
b21 | AC | 51 ms | 1792 KB |
b22 | AC | 54 ms | 1792 KB |
b23 | AC | 1 ms | 256 KB |
b24 | AC | 2 ms | 256 KB |