# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62006 | 2018-07-27T08:32:28 Z | Osama_Alkhodairy | Fortune Telling 2 (JOI14_fortune_telling2) | C++17 | 4 ms | 376 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define finish(x) return cout << x << endl, 0; int n, q, x, y; vector <pair <int, int> > a; vector <int> b; int main(){ ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> n >> q; for(int i = 0 ; i < n && cin >> x >> y ; i++) a.push_back(make_pair(x, y)); for(int i = 0 ; i < q && cin >> x ; i++) b.push_back(x); ll ans = 0; for(auto &i : a){ x = i.first, y = i.second; for(int j = 0 ; j < b.size() ; j++){ if(b[j] >= x || b[j] >= y) swap(x, y); } ans += x; } cout << ans << endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |