提出 #48765280

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define ll long long
#define PII pair<int,int>
 #define int long long
using namespace std;
const ll mod=1e9+7; 
const ll inf=0x3f3f3f3f;  
const ll INF=0x3f3f3f3f3f3f3f3f;  
const double eps=1e-10;  
const int N=2e5+10;
// struct node{
//     friend bool operator<(const node&a,const node&b){
//         return ;
//     }
// }
//priority_queue<ll,vector<ll>,greater<ll>>pq;
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
inline void write(int x){char F[200];int tmp=x>0?x:-x;if(x<0) putchar('-');int cnt=0;while(tmp>0){F[cnt++]=tmp%10+'0';tmp/=10;}while(cnt>0)putchar(F[--cnt]);}
inline int combination(int n,int k){int sum=0;if (n==k||k==0){return 1;}else{return combination(n-1,k)+combination(n-1,k-1);}}

void solve(){
    int n=read(),q=read();
    vector<int>a(n+1);
    for(int i=1;i<=n;i++){
        a[i]=read();
    }
    sort(a.begin()+1,a.end());
    vector<int>pre(n+1);
    for(int i=1;i<=n;i++){
        pre[i]=pre[i-1]+a[i];
    }
    while(q--){
        int x=read(),ans=lower_bound(pre.begin(),pre.end(),x)-pre.begin();
        if(pre[ans]!=x) ans--;
        cout<<ans<<'\n';
    }
    //puts(ans>0?"YES":"NO");
    //puts(ans>0?"Yes":"No");
}

signed main(){
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    // cout.tie(0);
    int t=1;
  //  int t=read();
    while(t--){
        solve();
    }
}

提出情報

コンパイルエラー

Main.cpp: In function ‘long long int combination(long long int, long long int)’:
Main.cpp:19:41: warning: unused variable ‘sum’ [-Wunused-variable]
   19 | inline int combination(int n,int k){int sum=0;if (n==k||k==0){return 1;}else{return combination(n-1,k)+combination(n-1,k-1);}}
      |                                         ^~~

ジャッジ結果