#include<bits/stdc++.h> using namespace std; // define #define execute cerr << " Time: " << fixed << setprecision(6) << (1.0 * clock() / CLOCKS_PER_SEC) << "s\n"; #define ll long long #define ii pair <int , int> #define iii pair <int , ii> #define se second #define fi first #define all(v) (v).begin() , (v).end() #define Unique(v) sort(all(v)) , v.resize(unique(all(v)) - v.begin()) #define bit(x,i) (((x) >> (i)) & 1LL) #define flip(x,i) ((x) ^ (1LL << (i))) #define ms(d,x) memset(d , x , sizeof(d)) #define exist __exist #define ends __ends #define visit visited #define left __left #define right __right #define prev __prev #define next __next #define sitingfake 1 #define orz 1 //constant const long long mod = 1e9 + 7; const long long linf = 4557430888798830399LL; const long long nlinf = -4485090715960753727LL; const int LOG = 20; const int inf = 1061109567; const int ninf = -1044266559; const int dx[] = {0 , -1 , 0 , 1}; const int dy[] = {-1 , 0 , 1 , 0}; template<typename T> bool maximize(T &a, const T &b) { if(a < b) {a = b; return 1;} return 0; } template<typename T> bool minimize(T &a, const T &b) { if(a > b) {a = b; return 1;} return 0; } void Plus(ll & a ,ll b) { b %= mod; a += b; if(a < 0) a += mod; a %= mod; return; } void Mul(ll & a, ll b) { (a *= (b % mod)) %= mod; return; } //code const int maxn = 2e5 + 7; int n , k; ii t[maxn]; struct info { int l , r; bool flag = 0; bool operator < (info &other) { return r > other.r; } }a[maxn]; int st[4 * maxn] , bit[maxn]; void up(int x) { for(;x > 0; x -= (x & -x)) bit[x]++; } int get(int x) { int ans = 0; for(;x <= k; x += (x & -x)) ans += bit[x]; return ans; } void build(int i , int l , int r) { if(l == r) { st[i] = t[l].fi; return; } int mid = (r + l) >> 1; build(i * 2 + 1 , mid + 1 , r); build(i * 2 , l, mid); st[i] = max(st[i * 2] , st[i * 2 + 1]); } int walk(int i , int l , int r , int val) { if(st[i] < val) return 0; if(l == r) return l; int mid = (r + l) >> 1; if(st[i * 2 + 1] >= val) return walk(i * 2 + 1 , mid + 1 , r , val); return walk(i * 2 , l , mid , val); } void del(int i , int l , int r , int pos) { if(pos < l || pos > r) return; if(l == r) { st[i] = -inf; return; } int mid = (r + l) >> 1; del(i * 2 , l , mid , pos); del(i * 2 + 1 , mid + 1 , r , pos); st[i] = max(st[i * 2] , st[i * 2 + 1]); } void solve(void) { cin >> n >> k; for(int i = 1; i <= n; i++) { cin >> a[i].l >> a[i].r; if(a[i].l > a[i].r) { a[i].flag = 1; swap(a[i].l , a[i].r); } } for(int i = 1; i <= k; i++) { cin >> t[i].fi; t[i].se = i; } build(1 , 1 , k); sort(a + 1 , a + n + 1); sort(t + 1 , t + k + 1 , greater <ii> ()); int it = 1; ll ans = 0; for(int i = 1; i <= n; i++) { while(it <= k && t[it].fi >= a[i].r) { del(1 , 1 , k , t[it].se); up(t[it].se); it++; } int pos = walk(1 , 1 , k , a[i].l); if(pos == 0) { int val = get(1); if(val & 1) { if(a[i].flag) { ans += a[i].l; } else ans += a[i].r; } else { if(a[i].flag) ans += a[i].r; else ans += a[i].l; } } else { int val = get(pos + 1); if(val & 1) ans += a[i].l; else ans += a[i].r; } } cout << ans; } /** **/ signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define task "" if(fopen(task".inp","r")) { freopen(task".inp","r",stdin); freopen(task".out","w",stdout); } int tc = 1; // cin >> tc; while(tc--) solve(); // execute; }

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:195:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  195 |        freopen(task".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:196:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  196 |        freopen(task".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~