#629723 (C++14) No.1430 Coup de Coupon

• 問題: No.1430 Coup de Coupon
• ユーザー: shimarut
• 提出日時: 2021-03-14 14:29:50
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 3,235 bytes
• コンパイル時間: 1,631 ms
• コンパイル使用メモリ: 135,216 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-11-06 04:13:21
• 合計ジャッジ時間: 3,291 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,820 KB
testcase_01	AC	2 ms; 6,816 KB
testcase_02	AC	2 ms; 6,816 KB
testcase_03	AC	4 ms; 6,816 KB
testcase_04	AC	4 ms; 6,816 KB
testcase_05	AC	4 ms; 6,816 KB
testcase_06	AC	58 ms; 6,816 KB
testcase_07	AC	58 ms; 6,816 KB
testcase_08	AC	58 ms; 6,820 KB
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	AC	35 ms; 6,816 KB
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	2 ms; 6,820 KB
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-

ソースコード

#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <sstream>
#include <regex>
#include <fstream>
#include <array>
//#include <atcoder/all>
//
//using namespace atcoder;
//using mint = modint1000000007;
////using mint = modint998244353;
////using mint = modint;
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i))
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

#pragma region UnionFind
struct UnionFind
{
	vector<int> par;

	UnionFind(int n) : par(n, -1) {}
	void init(int n) { par.assign(n, -1); }

	int root(int x)
	{
		if (par[x] < 0) return x;
		else return par[x] = root(par[x]);
	}

	bool issame(int x, int y)
	{
		return root(x) == root(y);
	}

	bool merge(int x, int y)
	{
		x = root(x); y = root(y);
		if (x == y) return false;
		if (par[x] > par[y]) swap(x, y);
		par[x] += par[y];
		par[y] = x;
		return true;
	}

	int size(int x)
	{
		return -par[root(x)];
	}
};
#pragma endregion
#pragma region GCD
ll gcd(ll a, ll b)
{
	if (b == 0)return a;
	return gcd(b, a % b);
}
#pragma endregion
#pragma region LCM
ll lcm(ll a, ll b)
{
	return a / gcd(a, b) * b;
}
#pragma endregion
#pragma region chmin
template<class T> inline bool chmin(T& a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
#pragma endregion
#pragma region chmax
template<class T> inline bool chmax(T& a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}
#pragma endregion
#pragma region グリッド内チェック
bool out(int x, int y, int h, int w)
{
	if (x < 0 || h <= x || y < 0 || w <= y)return true;
	else return false;
}
#pragma endregion
#pragma region Dijkstra
vl dijkstra(vector<vector<pair<int, ll>>> v, int s)
{
	ll INF = 1e18;
	int MAX = 1e6;
	vl res(MAX, INF);
	priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q;
	q.push({ 0,s });
	while (!q.empty())
	{
		int now;
		ll d;
		tie(d, now) = q.top();
		q.pop();
		if (!chmin(res[now], d))continue;
		for (auto p : v[now])
		{
			int next;
			ll c;
			tie(next, c) = p;
			if (res[next] <= res[now] + c)continue;
			q.push({ res[now] + c,next });
		}
	}
	return res;
}
#pragma endregion
#pragma endregion


int main()
{
	int n, c; cin >> n >> c;
	vi p(n); rep(i, n)cin >> p[i];
	vector<pint> v(c);
	rep(i, c)cin >> v[i].first >> v[i].second;
	sort(rall(p));
	sort(rall(v));
	ll res = 0;
	vector<bool> used(c);
	rep(i, n)
	{
		int index = -1;
		int mn = p[i];
		rep(j, c)
		{
			if (used[j])continue;
			if (v[j].first == 1)
			{
				if (chmin(mn, max(p[i] - v[j].second, 0)))index = j;
			}
			else
			{
				if (chmin(mn, (p[i] * (100 - v[j].second) / 100)))index = j;
			}
		}
		if (index != -1)used[index] = true;
		res += mn;
	}
	cout << res << endl;
}