제출 #1352651

#제출 시각아이디문제언어결과실행 시간메모리
1352651hyyhTrain Or Bus (NOI25_trainorbus)C++20
100 / 100
0 ms344 KiB
#include <iostream>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <iomanip>
#include <set>
#include <bitset>
#include <unordered_map>

#define int long long

using namespace std;
using ll = long long;
using pii = pair<int,int>;
using piii = tuple<int,int,int>;
#define f first
#define s second
#define endl '\n'
#define all(x) begin(x),end(x)

signed main(){
    int n;cin >> n;
    vector<pii> vc(n);
    for(int i{};i < n;i++) cin >> vc[i].f;
    for(int i{};i < n;i++) cin >> vc[i].s;
    int ans = 0;
    for(auto [a,b]:vc) ans += min(a,b);
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...