Submission #1949063


Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
#define max(a,b) a>b?a:b
inline void read(int &x)
{
    x=0;int f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
}
int n,m,ans,y[100005],mx,i;
int main()
{
    read(n);read(m);
    for(int i=1;i<=n;i++){int x;read(x);mx=max(mx,x);read(y[i]);}
    sort(y+1,y+n+1);
    for(i=n;i;i--){if(y[i]<=mx) break;m-=y[i];if(m<0){cout<<n-i+1<<"\n";return 0;}}
    ans=n-i+(m-1)/mx+1;
    cout<<ans<<"\n";
}

Submission Info

Submission Time
Task D - Katana Thrower
User ZincSabian
Language C++14 (GCC 5.4.1)
Score 0
Code Size 580 Byte
Status WA
Exec Time 19 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 4
AC × 21
WA × 3
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 19 ms 640 KB
b07 AC 1 ms 256 KB
b08 AC 19 ms 640 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 6 ms 640 KB
b14 WA 5 ms 640 KB
b15 AC 5 ms 640 KB
b16 AC 5 ms 640 KB
b17 AC 15 ms 640 KB
b18 AC 12 ms 640 KB
b19 AC 8 ms 640 KB
b20 WA 10 ms 640 KB
b21 AC 14 ms 640 KB
b22 WA 13 ms 640 KB
b23 AC 1 ms 256 KB
b24 AC 1 ms 256 KB