제출 #1338802

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1338802		athena	Bikeparking (EGOI24_bikeparking)	C++20	0 / 100	21 ms	5128 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long int

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin>>n;
    int arr[n];
    int brr[n];
    int s=0;
    for(int i=0;i<n;i++){
    cin>>arr[i];s+=arr[i];
}
    for(int i=0;i<n;i++)
    cin>>brr[i];
    //x=1 x=0 y=1 y=0
    //give lower ppl higher places
    //the sum of x is the max possible upvote we can get
//place diagonally???
//what if a place is free which without kicking out 0
if(brr[0]==1)
    cout<<s-1<<endl;
else
    cout<<s<<endl;
    
}

• Subtask 1: 0 / 16
• Subtask 2: 0 / 9
• Subtask 3: 0 / 19
• Subtask 4: 0 / 24
• Subtask 5: 0 / 32