# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62006 | Osama_Alkhodairy | Fortune Telling 2 (JOI14_fortune_telling2) | C++17 | 4 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |