Submission #6815163


Source Code Expand

Copy
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define EB emplace_back

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;

const int INF = 1e9 + 7;

pi a[100005];

int main()
{
	IO_OP;
	
	int n, m;
	cin >> n >> m;
	for(int i=0;i<n;i++)
		cin >> a[i].S >> a[i].F;
	sort(a, a+n, greater<pi>());
	set<int> s;
	for(int i=0;i<=m;i++)
		s.insert(i);
	int ans = 0;
	for(int i=0;i<n;i++) {
		int l = m - a[i].S;
		if(s.upper_bound(l) == s.begin()) continue;
		int t = *prev(s.upper_bound(l));
		s.erase(t);
		ans += a[i].F;
	}
	cout << ans << endl;

}

Submission Info

Submission Time
Task D - Summer Vacation
User cheissmart
Language C++14 (GCC 5.4.1)
Score 400
Code Size 746 Byte
Status AC
Exec Time 94 ms
Memory 5760 KB

Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
AC × 21
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15, testcase_16, testcase_17, testcase_18
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 1 ms 256 KB
testcase_01 AC 20 ms 3200 KB
testcase_02 AC 8 ms 1920 KB
testcase_03 AC 34 ms 2304 KB
testcase_04 AC 94 ms 5760 KB
testcase_05 AC 93 ms 5760 KB
testcase_06 AC 32 ms 2816 KB
testcase_07 AC 92 ms 5632 KB
testcase_08 AC 14 ms 1920 KB
testcase_09 AC 33 ms 3968 KB
testcase_10 AC 55 ms 5760 KB
testcase_11 AC 47 ms 5120 KB
testcase_12 AC 12 ms 1664 KB
testcase_13 AC 52 ms 5760 KB
testcase_14 AC 46 ms 5248 KB
testcase_15 AC 4 ms 640 KB
testcase_16 AC 52 ms 5760 KB
testcase_17 AC 7 ms 1152 KB
testcase_18 AC 56 ms 5760 KB