Submission #2530108
Source Code Expand
#include <iostream> #include <algorithm> using namespace std; int main(){ int N, H; int ans =0; int a[100005], b[100005]; cin >> N >> H; for(int i =0; i < N ; i++){ cin >>a[i] >> b[i]; } std::sort(a, a+N, std::greater<int>()); std::sort(b, b+N, std::greater<int>()); for(int i =0 ; i <N; i++){ if(a[0] > b[i]){ break; } H -= b[i]; ans++; if(H <=0){ cout << ans << endl; return 0; } } ans += (H +a[0] -1)/ a[0]; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Katana Thrower |
User | tawawa |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 634 Byte |
Status | AC |
Exec Time | 117 ms |
Memory | 1024 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 | 117 ms | 1024 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 115 ms | 1024 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 | 1024 KB |
b14 | AC | 38 ms | 1024 KB |
b15 | AC | 38 ms | 1024 KB |
b16 | AC | 38 ms | 1024 KB |
b17 | AC | 72 ms | 1024 KB |
b18 | AC | 60 ms | 1024 KB |
b19 | AC | 50 ms | 1024 KB |
b20 | AC | 55 ms | 1024 KB |
b21 | AC | 64 ms | 1024 KB |
b22 | AC | 70 ms | 1024 KB |
b23 | AC | 1 ms | 256 KB |
b24 | AC | 3 ms | 256 KB |