Submission #1840779

---

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);
}

typedef long long Int;
const Int B = 10000;      // base (power of 10)
const int BW = 4;         // log B
const int MAXDIGIT = 10000; // it can represent 4*MAXDIGIT digits (in base 10)
struct BigNum {
	Int digit[MAXDIGIT];
	int size;
	BigNum(int size = 1, Int a = 0) : size(size) {
		memset(digit, 0, sizeof(digit));
		digit[0] = a;
	}
};

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);
		sushi[i].second *= -1;
	}
	int ans = 0;
	int csum = 0;
	priority_queue<pii, vector<pii>, greater<pii>> al;
	REP(i, m-1) {
		csum += sushi[i].first;
		al.push(sushi[i]);
	}

	ans = csum;

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

		csum += sushi[i].first;

		al.push(sushi[i]);
		auto tp = al.top();
		al.pop();
		csum -= tp.first;
		csum += -tp.second;
	}


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

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:76: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