A. if else 即可
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
void solve(){
int n;cin>>n;int cnt1=0,cnt2=0;
for(int i=1;i<=n;i++){
int x;cin>>x;
if(x>=0)cnt1+=x;
else cnt2+=x;
}
cout<<abs(cnt1-(0-cnt2))<<'\n';
}
signed main(){
int t;cin>>t;
while(t--){
solve();
}
}
B. 让B在后面N在前面尽可能
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
void solve(){
int n;cin>>n;
cout<<(n+1)/2<<endl;
for(int i=1,j=3*n;i<=j;i+=3,j-=3) {
cout<<i<<" "<<j<<'\n';
}
}
signed main(){
int t;cin>>t;
while(t--){
solve();
}
}
C. 找个样例就能发现 a[1]必须是小于a[2]->a[n]
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7,N=2e5+10;
int a[N];
void solve(){
int n;cin>>n;int a1=0;
for(int i=1;i<=n;i++){
cin>>a[i];
a1=a[1];
}
sort(a+1,a+1+n);
if(a1==a[1])cout<<"Bob"<<'\n';
else cout<<"Alice"<<'\n';
}
signed main(){
int t;cin>>t;
while(t--){
solve();
}
}
D. 等等再补吧 (最近越大越菜,难受ing)