#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin>>n>>k;
if(n==1){
bool f=false;
for(int i=0; i<k; ++i){
int a;
cin>>a;
if(a!=0){
f=true;
break;
}
}
for(int i=0; i<k; ++i){
int a;
cin>>a;
}
if(!f){
cout<<1<<endl;
} else{
cout<<0<<endl;
}
} else if(k==1){
vector<pair<int, int>> num(n);
for(int i=0; i<n; ++i){
int a;
cin>>a;
num[i].first=a;
}
for(int i=0; i<n; ++i){
int a;
cin>>a;
num[i].second=a;
}
sort(num.begin(), num.end());
int s=0, res=0;
for(auto c:num){
if(s>=c.first){
res++;
s+=c.second;
} else{
break;
}
}
cout<<res<<endl;
} else{
for(int i=0; i<n; ++i){
for(int j=0; j<k; ++j){
int a;
cin>>a;
}
}
cout<<2<<endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |