Submission #1947696
Source Code Expand
#include <algorithm> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <ctime> #include <iostream> #include <sstream> #include <functional> #include <map> #include <string> #include <cstring> #include <vector> #include <queue> #include <stack> #include <deque> #include <set> #include <list> #include <numeric> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll,ll> P; const double PI = 3.14159265358979323846; const double EPS = 1e-12; const ll INF = 1LL<<29; const ll mod = 1e9+7; #define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i)) #define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d)) #define all(v) (v).begin(), (v).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset((m),(v),sizeof(m)) #define chmin(x,y) (x=min(x,y)) #define chmax(x,y) (x=max(x,y)) #define fst first #define snd second #define UNIQUE(x) (x).erase(unique(all(x)),(x).end()) template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;} int main(){ ll n, h; cin>>n>>h; ll mx = 0; vector<ll> b(n); rep(i, n){ ll a; cin>>a>>b[i]; chmax(mx, a); } sort(all(b)); ll res = 0; while(h>0&&!b.empty()){ ll t = b.back(); if(t<=mx) break; res++; h -= t; b.pop_back(); } if(h>0) res += (h+mx-1)/mx; cout<<res<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Katana Thrower |
User | Lepton |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1463 Byte |
Status | AC |
Exec Time | 87 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 | 86 ms | 1024 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 87 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 | 33 ms | 1024 KB |
b14 | AC | 33 ms | 1024 KB |
b15 | AC | 33 ms | 1024 KB |
b16 | AC | 33 ms | 1024 KB |
b17 | AC | 54 ms | 1024 KB |
b18 | AC | 47 ms | 1024 KB |
b19 | AC | 40 ms | 1024 KB |
b20 | AC | 44 ms | 1024 KB |
b21 | AC | 51 ms | 1024 KB |
b22 | AC | 53 ms | 1024 KB |
b23 | AC | 1 ms | 256 KB |
b24 | AC | 3 ms | 256 KB |