Commit f519f14

committed

Today ps

1 parent daa4a5f commit f519f14Copy full SHA for f519f14

File tree

+49

-0

lines changed

+49

-0

lines changed

Lines changed: 49 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,49 @@`
	`1`	`+#include <bits/stdc++.h>`
	`2`	`+`
	`3`	`+using namespace std;`
	`4`	`+using ll = long long;`
	`5`	`+using pii = pair<ll, ll>;`
	`6`	`+`
	`7`	`+inline bool compare(pii &a, pii &b)`
	`8`	`+{`
	`9`	`+ return a.first < b.first;`
	`10`	`+}`
	`11`	`+`
	`12`	`+int main()`
	`13`	`+{`
	`14`	`+ ios::sync_with_stdio(false);`
	`15`	`+ cin.tie(nullptr);`
	`16`	`+ cout.tie(nullptr);`
	`17`	`+ ll n, k, m, v, i, j, res = 0;`
	`18`	`+ priority_queue<ll> pq;`
	`19`	`+ cin >> n >> k;`
	`20`	`+ ll bag[k];`
	`21`	`+ pii dia[n];`
	`22`	`+ for (i = 0; i < n; i++)`
	`23`	`+ {`
	`24`	`+ cin >> m >> v;`
	`25`	`+ dia[i] = make_pair(m, v);`
	`26`	`+ }`
	`27`	`+ for (i = 0; i < k; i++)`
	`28`	`+ {`
	`29`	`+ cin >> bag[i];`
	`30`	`+ }`
	`31`	`+ sort(bag, bag + k);`
	`32`	`+ sort(dia, dia + n, compare);`
	`33`	`+ j = 0;`
	`34`	`+ for (i = 0; i < k; i++)`
	`35`	`+ {`
	`36`	`+ while (j < n && dia[j].first <= bag[i])`
	`37`	`+ {`
	`38`	`+ pq.push(dia[j].second);`
	`39`	`+ j += 1;`
	`40`	`+ }`
	`41`	`+ if (!pq.empty())`
	`42`	`+ {`
	`43`	`+ res += pq.top();`
	`44`	`+ pq.pop();`
	`45`	`+ }`
	`46`	`+ }`
	`47`	`+ cout << res;`
	`48`	`+ return 0;`
	`49`	`+}`

Comments

(0)