Submission #1247505

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()

#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i = (a); i <= (int)(b); i++)
#define FA(it, x) for(__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define SZ(x) (int)(x).size()
#define BE(x) (x).begin(), (x).end()
#define SORT(x) sort(BE(x))
#define _1 first
#define _2 second

#define x1 gray_cat_x1
#define y1 gray_cat_y1

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }

#define file "cycle"

const double EPS = 1e-9;
const double PI = acos(-1.);
const int INF = 1e9;
const ll MOD = 1e9 + 7;

const int MAXN = 2e5 + 5;

vector<pii> pp;

int cnt[2], lim[2];

void solve(){
	scanf("%d%d", &lim[0], &lim[1]);
	REP(i, 0, 2){
		REP(j, 0, lim[i]){
			int a;
			scanf("%d", &a);
			pp.pb(mp(a, i));
		}
	}
	SORT(pp);
	ll ans = 0ll;
	//ll cnt = (ll)lim[0] * (ll)lim[1];
	REP(i, 0, SZ(pp)){
		int ind = pp[i]._2;
		/*ll add = 0ll;
		if (!cnt[ind ^ 1]){
			add = lim[ind ^ 1];
		} else {
			add = lim[ind ^ 1] - max(0, cnt[ind ^ 1] - 1);
		}*/
		ll add = lim[ind ^ 1] - cnt[ind ^ 1] + 1;
		//cout << add << " " << add * pp[i]._1 << endl;
		ans += add * pp[i]._1;
		cnt[ind]++;
	}
	printf("%lld\n", ans);
}	

int main(){

	//freopen(file".in", "r", stdin); freopen(file".out", "w", stdout);
	int t = 1;
	//cin >> t;
	while(t--){
		solve();	
	}
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:41:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &lim[0], &lim[1]);
                                 ^
./Main.cpp:45:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a);
                   ^

Judge Result