Submission #1162919

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cmath>
#include <complex>
#include <cctype>
#include <cassert>
#include <sstream>
#include <ctime>
 
using namespace std;
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
 
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;
typedef vector<pii> vp;

#define INF (1<<29)
#define INFL (1ll<<60)
#define EPS (1e-8)
#define PI (acos(-1))
const ll MOD = 1000000007ll;

int w, h;
int p[112345], q[112345];

int main() {
	cin >> w >> h;
	REP(i, w) scanf("%d", p + i);
	REP(i, h) scanf("%d", q + i);
	
	priority_queue<pii, vector<pii>, greater<pii> > pq;
	REP(i, w) pq.push(pii(p[i], 0));
	REP(i, h) pq.push(pii(q[i], 1));
	
	
	int cnt[2] = {};
	ll ans = 0;
	
	while (!pq.empty()) {
		pii now = pq.top(); pq.pop();
		
		int cost = now.first;
		int pat = now.second;
		
		if (pat == 0) {
			ans += (ll)cost * (h + 1 - cnt[1]);
			cnt[0]++;
		}
		else {
			ans += (ll)cost * (w + 1 - cnt[0]);
			cnt[1]++;
		}
	}
	cout << ans << endl;
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:43:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i, w) scanf("%d", p + i);
                              ^
./Main.cpp:44:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i, h) scanf("%d", q + i);
                              ^

Judge Result