Submission #1540628

---

Source Code Expand

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define MAXN 100005
#define lint long long
#define trace(x) cout<<#x<<" = "<<x<<'\n'
#define trace2(x, y) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<'\n'
#define tracea(arr, i) cout<<#arr<<"["<<i<<"]"<<" = "<<arr[i]<<'\n'
#define print(arr, n) for (int iDx = 0; iDx < (n); iDx++) cout << arr[iDx] << " \n"[iDx == (n)-1]
#define sz(x) (int)(x).size()
using namespace std;
struct ii {
	lint a, b;
	bool operator < (ii o) const { return a*o.b > o.a*b; }
};
struct iii {
	int a, b, c;
	bool operator < (iii o) const { return make_tuple(a, b, c) < make_tuple(o.a, o.b, o.c); }
};
int TC, M, K, Q, x, y, z;

lint N, arr[5];
priority_queue<ii> pq;

int main() {
	#ifdef FAIRUZI10
	freopen("/home/fairuzi/Documents/CP/input.in", "r", stdin);
	#endif
	
	scanf("%lld%lld%lld%lld", &arr[0], &arr[1], &arr[2], &arr[3]);
	pq.push({arr[0], 1});
	pq.push({arr[1], 2});
	pq.push({arr[2], 4});
	pq.push({arr[3], 8});
	scanf("%lld", &N);
	N <<= 2;
	lint ans = 0;
	while (N) {
		ii now = pq.top();
		pq.pop();
		lint banyak = N/now.b;
		ans += banyak*now.a;
		N %= now.b;
	}
	printf("%lld\n", ans);
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:63: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld%lld", &arr[0], &arr[1], &arr[2], &arr[3]);
                                                               ^
./Main.cpp:35:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &N);
                   ^

Judge Result