Submission #1949408
Source Code Expand
#include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include <map> using namespace std; const int maxn = 100007; int a[maxn],b[maxn]; int main() { int sum,n,max1=0,l; cin>>n>>sum; for(int i=1;i<=n;i++) { cin>>a[i]>>b[i]; if(max1<a[i]) { max1=a[i]; l=i; } } int sum1 = 0; int ans = 0; sort(b+1,b+1+n); int now = n; while(sum1<sum) { if(b[now]>max1) { sum1+=b[now]; ans++; b[now]=0; now--; } else { sum1+=max1; ans++; } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Katana Thrower |
User | sortmin |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 574 Byte |
Status | AC |
Exec Time | 1012 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 | 840 ms | 256 KB |
a04 | AC | 1 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 115 ms | 1024 KB |
b07 | AC | 977 ms | 256 KB |
b08 | AC | 115 ms | 1024 KB |
b09 | AC | 977 ms | 256 KB |
b10 | AC | 489 ms | 256 KB |
b11 | AC | 489 ms | 256 KB |
b12 | AC | 332 ms | 256 KB |
b13 | AC | 1012 ms | 1024 KB |
b14 | AC | 37 ms | 1024 KB |
b15 | AC | 38 ms | 1024 KB |
b16 | AC | 525 ms | 1024 KB |
b17 | AC | 67 ms | 1024 KB |
b18 | AC | 57 ms | 1024 KB |
b19 | AC | 59 ms | 1024 KB |
b20 | AC | 53 ms | 1024 KB |
b21 | AC | 60 ms | 1024 KB |
b22 | AC | 67 ms | 1024 KB |
b23 | AC | 202 ms | 256 KB |
b24 | AC | 3 ms | 256 KB |