Submission #1948144
Source Code Expand
#include<iostream> #include<cstdio> #include<algorithm> #include<vector> #include<string.h> #include<string> #include<set> #include<limits.h> #include<set> #include<map> #include<unordered_map> #include<unordered_set> #include<list> #include<functional> #include<stack> #include<deque> #include<queue> using namespace std; vector<int>V; signed main() { int n, h; cin >> n >> h; int MAX = 0; for (int i = 0; i < n; i++) { int a, b; cin >> a >> b; MAX = max(MAX, a); V.push_back(b); } sort(V.begin(), V.end(), greater<int>()); int sum = 0; for (int i = 0; i < V.size(); i++) { if (V[i] < MAX)break; sum++; h -= V[i]; if (h <= 0) { cout << i + 1 << endl; return 0; } } cout << sum + (h - 1) / MAX + 1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Katana Thrower |
User | naoki2016 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 780 Byte |
Status | AC |
Exec Time | 116 ms |
Memory | 892 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 | 115 ms | 892 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 116 ms | 892 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 | 38 ms | 892 KB |
b14 | AC | 38 ms | 892 KB |
b15 | AC | 38 ms | 892 KB |
b16 | AC | 38 ms | 892 KB |
b17 | AC | 68 ms | 892 KB |
b18 | AC | 57 ms | 892 KB |
b19 | AC | 53 ms | 892 KB |
b20 | AC | 53 ms | 892 KB |
b21 | AC | 61 ms | 892 KB |
b22 | AC | 67 ms | 892 KB |
b23 | AC | 1 ms | 256 KB |
b24 | AC | 3 ms | 256 KB |