6 solutions

  • 6
    @ 2024-5-24 11:18:12
    #include<bits/stdc++.h>
    using namespace std;
    int main() 
    {
    	int a,b,c,k=0;
    	cin>>a>>b;
    	for(int i=1;i<=b;i++)
    	{
    		cin>>c; //当前取到的药的数量 
    		if(c<=a) //可以取 
    		{
    			a=a-c;
    		}
    		else //取不到 
    		{
    			k=k+1;	
    		}
    		
    	}
    	cout<<k;
    	return 0;
    }
    
    • 0
      @ 2026-6-12 20:05:14

      #include<bits/stdc++.h> using namespace std; int main() { int a,b; cin>>a>>b; int n=0; for(int i=1;i<=b;i++) { int x; cin>>x; if(x>a) { n=n+1; } else { a=a-x; } } cout<<n; return 0; }

      • 0
        @ 2026-2-3 10:06:04

        cpp, #include<bits/stdc++.h> using namespace std; int main() { int a,b,c,k=0; cin>>a>>b; for(int i=1;i<=b;i++) { cin>>c; if(c<=a) { a=a-c; } else { k=k+1; }

        }
        cout<<k;
        return 0;
        

        }

        • 0
          @ 2026-2-3 10:05:48

          #include<bits/stdc++.h> using namespace std; int main() { int a,b,c,k=0; cin>>a>>b; for(int i=1;i<=b;i++) { cin>>c; if(c<=a) { a=a-c; } else { k=k+1; }

          }
          cout<<k;
          return 0;
          

          }

          • 0
            @ 2026-2-3 10:04:47
            #include<bits/stdc++.h>
            using namespace std;
            int main() 
            {
            	int a,b,c,k=0;
            	cin>>a>>b;
            	for(int i=1;i<=b;i++)
            	{
            		cin>>c; 
            		if(c<=a) 
            		{
            			a=a-c;
            		}
            		else 
            		{
            			k=k+1;	
            		}
            		
            	}
            	cout<<k;
            	return 0;
            }
            
            • -1
              @ 2025-6-14 10:44:22

              #include<bits/stdc++.h> using namespace std; int main() { int a,b,c,k=0; cin>>a>>b; for(int i=1;i<=b;i++) { cin>>c; //当前取到的药的数量 if(c<=a) //可以取 { a=a-c; } else //取不到 { k=k+1; }

              }
              cout<<k;
              return 0;
              

              }

              • 1

              Information

              ID
              880
              Time
              1000ms
              Memory
              256MiB
              Difficulty
              1
              Tags
              (None)
              # Submissions
              236
              Accepted
              96
              Uploaded By