Submission #1840842


Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <string>
#include <iomanip>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#include <nmmintrin.h>
#include <chrono>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b)   ((a >> b) & 1)
#define bitset(a,b)      ( a |= (1 << b))
#define bitunset(a,b)    (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
#ifdef _MSC_VER
#define __builtin_popcount _mm_popcnt_u32
#define __builtin_popcountll _mm_popcnt_u64
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
	std::fill((T*)array, (T*)(array + N), val);
}
int main(void) {
	int n, m;

	cin >> n >> m;
	vector<pii> sushi(n);
	REP(i, n) {
		scnaf("%d %d", &sushi[i].first, &sushi[i].second);
	}
	int ans = 0;
	int csum = 0;
	multiset<int> al;
	REP(i, min(n,m)-1) {
		csum += sushi[i].first;
		al.insert(sushi[i].first - sushi[i].second);
	}

	ans = csum;

	rep(i, m-1, n) {
		csum += sushi[i].first;
		ans = max(ans, csum);


		al.insert(sushi[i].first - sushi[i].second);
		auto tp = *al.begin();
		al.erase(al.begin());
		csum -= tp;
	}


	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task D - ネタだけ食べたい寿司
User Gear
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2089 Byte
Status WA
Exec Time 42 ms
Memory 5760 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:62:52: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scnaf("%d %d", &sushi[i].first, &sushi[i].second);
                                                    ^

Judge Result

Set Name All
Score / Max Score 0 / 600
Status
AC × 26
WA × 20
Set Name Test Cases
All 00-sample1, 00-sample2, 00-sample3, 01-smallest01, 02-largest01, 03-random01, 03-random02, 03-random03, 03-random04, 03-random05, 03-random06, 03-random07, 03-random08, 03-random09, 03-random10, 03-random11, 03-random12, 03-random13, 03-random14, 03-random15, 03-random16, 03-random17, 03-random18, 03-random19, 03-random20, 03-random21, 03-random22, 03-random23, 03-random24, 03-random25, 03-random26, 03-random27, 03-random28, 03-random29, 03-random30, 03-random31, 03-random32, 03-random33, 03-random34, 03-random35, 04-corner01, 04-corner02, 04-corner03, 04-corner04, 04-corner05, 04-corner06
Case Name Status Exec Time Memory
00-sample1 AC 1 ms 256 KB
00-sample2 AC 1 ms 256 KB
00-sample3 WA 1 ms 256 KB
01-smallest01 AC 1 ms 256 KB
02-largest01 AC 38 ms 5760 KB
03-random01 WA 1 ms 256 KB
03-random02 WA 1 ms 256 KB
03-random03 AC 1 ms 256 KB
03-random04 AC 1 ms 256 KB
03-random05 WA 1 ms 256 KB
03-random06 WA 1 ms 256 KB
03-random07 AC 1 ms 256 KB
03-random08 WA 1 ms 256 KB
03-random09 AC 1 ms 256 KB
03-random10 AC 1 ms 256 KB
03-random11 AC 1 ms 256 KB
03-random12 WA 1 ms 256 KB
03-random13 AC 1 ms 256 KB
03-random14 WA 1 ms 256 KB
03-random15 WA 1 ms 256 KB
03-random16 AC 1 ms 256 KB
03-random17 WA 1 ms 256 KB
03-random18 WA 1 ms 256 KB
03-random19 AC 1 ms 256 KB
03-random20 AC 1 ms 256 KB
03-random21 AC 42 ms 5120 KB
03-random22 AC 39 ms 4224 KB
03-random23 AC 35 ms 4096 KB
03-random24 WA 24 ms 3200 KB
03-random25 WA 25 ms 3328 KB
03-random26 AC 24 ms 3200 KB
03-random27 WA 23 ms 3072 KB
03-random28 WA 24 ms 3328 KB
03-random29 WA 35 ms 4480 KB
03-random30 AC 29 ms 3584 KB
03-random31 WA 39 ms 4864 KB
03-random32 WA 23 ms 3072 KB
03-random33 AC 39 ms 3456 KB
03-random34 WA 34 ms 4352 KB
03-random35 AC 42 ms 4096 KB
04-corner01 WA 1 ms 256 KB
04-corner02 AC 1 ms 256 KB
04-corner03 AC 1 ms 256 KB
04-corner04 AC 1 ms 256 KB
04-corner05 AC 1 ms 256 KB
04-corner06 AC 31 ms 3328 KB