Editorial for 子集合的和
Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.
Submitting an official solution before solving the problem yourself is a bannable offence.
Author:
僅供參考
#define ll long long
#define ll0 (ll)0
using namespace std;
int main() {
int n;cin >> n;
ll ans = 0;
while(n--) {
ll a;cin >> a;
if(a > ll0) ans += a;
}
cout << ans;
return 0;
}
Comments