제출 #1158358

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1158358		Nurislam	Fortune Telling 2 (JOI14_fortune_telling2)	C++20	4 / 100	3092 ms	1752 KiB

fortune_telling2

#include <bits/stdc++.h>
  
using namespace std;
 
#define int long long

const int N = 2e5+2, inf = 1e18;

void solve(){
	int n, k;
	cin >> n >> k;
	multiset<array<int,3>> st;
	
	for(int i = 0; i < n; i ++ ){
		int a, b; cin >> a >> b;
		st.insert({a, b, i});
	};
	
	
	while(k -- ){
		int x; cin >> x;
		vector<array<int,3>> ad;
		while( st.size() ) {
			auto [a, b, i] = *st.begin();
			if(a > x)break;
			st.erase(st.begin());
			ad.push_back({b, a, i});
		};
		for(auto i : ad)st.insert(i);
	};
	
	int ans = 0;
	for(auto [a, b, i] : st)ans += a;
	
	cout << ans << '\n';
	
}
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int tt = 1;
    //cin >> tt;
    while(tt--){
        solve();
    };
}

 
 

• Subtask 1: 4 / 4
• Subtask 2: 0 / 31
• Subtask 3: 0 / 65