제출 #758270

#제출 시각아이디문제언어결과실행 시간메모리
758270JANCARAPANGarage (IOI09_garage)C++17
0 / 100
1088 ms340 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define fi first #define se second #define sz(a) (long long) a.size() #define endl '\n' const long long INF = 1e18, MOD = 1e9+7; void test_case() { int n, m; cin >> n >> m; multiset<int> r; for (int i = 0; i < n; i++) { int x; cin >> x; r.insert(x); } vector<int> w(m), cur(m); for (int i = 0; i < m; i++) cin >> w[i]; ll ans = 0; for (int i = 0; i < 2 * m; i++) { int p; cin >> p; if (p > 0) { p--; auto it = r.begin(); cur[p] = *it; ans += *it * w[p]; r.erase(it); } else { p++; r.insert(cur[-p]); } } cout << ans << endl; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); int tt = 1; //cin >> tt; while (tt--) { test_case(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...