lopov

input/code.cpp: In function 'int main()':
input/code.cpp:48:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i< pck.size(); ++i) {
                                ^

#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
const int MN = 3e5+100;
int m[MN];
int v[MN];
int c[MN];
const int N = 1<<19;
pair<int, int> st[2*N];
void setValue(int a, int v) {
    a += N;
    st[a].F = v;
    for(a/=2; a; a/=2) {
	st[a] = max(st[a*2], st[a*2+1]);
    }
}
int getMax(int a, int b) {
    a += N;
    b += N;
    pair<int, int> ma = {0, 0};
    for(; a <= b; a/=2, b/=2) {
	if(a&1) {
	    ma = max(ma, st[a++]);
	}
	if(~b&1) {
	    ma = max(ma, st[b--]);
	}
    }
    return ma.S;
}
vector<int> qwe[MN];
int main() {
    int n,k;
    cin>>n>>k;
    vector<int> pck;
    for(int i = 0; i < n; ++i) {
	cin>>m[i]>>v[i];
	pck.push_back(m[i]);
    }
    for(int i = 0; i < k; ++i) {
	cin>>c[i];
	pck.push_back(c[i]);
    }
    sort(pck.begin(), pck.end());
    pck.erase(unique(pck.begin(), pck.end()), pck.end());
    map<int, int> mp;
    for(int i = 0; i< pck.size(); ++i) {
	mp[pck[i]] = i;
    }
    //cout<<"LOl\n";
    for(int i = 0; i < n; ++i) {
	m[i] = mp[m[i]];
//	cout<<m[i]<<' '<<v[i]<<'\n';
	qwe[m[i]].push_back(v[i]);
    }
 //   cout<<"lasfd\n";
    for(int i = 0; i < MN; ++i) {
	sort(qwe[i].begin(), qwe[i].end());
	st[i+N].S = i;
	if(qwe[i].size()) {
	    st[i+N] = {qwe[i].back(), i};
	    qwe[i].pop_back();
	}
    }
    for(int i = 0; i < k;++i) {
	c[i] = mp[c[i]];
    }
    sort(c, c+k);
    /*
    for(int i = 0; i < k; ++i) {
	cout<<c[i]<<' ';
    }
    cout<<'\n';
    cout<<"asdf\n";
    */
    for(int i = N-1; i; --i) {
	st[i] = max(st[i*2], st[i*2+1]);
    }
    long long ans = 0;
    for(int i = 0; i < k; ++i) {
	int q = getMax(0, c[i]);
//	cout<<c[i]<<' ';
	ans += st[N+q].F;
//	cout<<st[N+1].F<<'\n';
	if(st[N+q].F == 0) continue;
	if(qwe[q].size() == 0) {
	    setValue(q, 0);
	}
	else {
	    setValue(q, qwe[q].back());
	    qwe[q].pop_back();
	}
    }
    cout<<ans<<'\n';
 
}
 

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED