제출 #1191808

#제출 시각아이디문제언어결과실행 시간메모리
1191808hqhFortune Telling 2 (JOI14_fortune_telling2)C++20
0 / 100
1 ms320 KiB
#include <bits/stdc++.h> #define ll long long #define _F "HCN" using namespace std; const ll MOD = 998244353; ll a[100005]; int main() { int n , q; cin >> n >> q; int a[n] , b[n] , c[n]; for (int i = 0 ; i < n ; i++){ cin >> a[i] >> b[i]; c[i] = a[i]; } while(q--){ int t; cin >> t; for (int i = 0 ; i < n ; i++){ if (c[i] <= t){ if (c[i] == a[i]) c[i] = b[i]; else c[i] = a[i]; } } } int tong = 0; for (int i = 0 ; i < n ; i++) tong += c[i]; cout << tong; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...