#647274 (C++17) No.1430 Coup de Coupon

• 問題: No.1430 Coup de Coupon
• ユーザー: tanimani364
• 提出日時: 2021-04-12 00:36:04
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,425 bytes
• コンパイル時間: 2,446 ms
• コンパイル使用メモリ: 209,808 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-27 22:07:00
• 合計ジャッジ時間: 3,330 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	3 ms; 5,376 KB
testcase_04	AC	3 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	4 ms; 5,376 KB
testcase_07	AC	4 ms; 5,376 KB
testcase_08	AC	4 ms; 5,376 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	3 ms; 5,376 KB
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	2 ms; 5,376 KB
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-

ソースコード

#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

ll mypow(ll x, ll n, const ll &p = -1)
{ //x^nをmodで割った余り

	if (p != -1)
	{
		x =(x%p+p)%p;
	}
	ll ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;

void solve()
{	
	int n,c;
	cin>>n>>c;
	vector<int>p(n);
	rep(i,n)cin>>p[i];
	vector<int>x,y;
	rep(i,c){
		int t,a;
		cin>>t>>a;
		if(t==1){
			x.eb(a);
		}else{
			y.eb(a);
		}
	}
	
	sort(rall(x));
	sort(rall(y));
	int posx=0,posy=0;
	priority_queue<int>pq;
	rep(i,n){
		pq.emplace(p[i]);
	}
	int sum=0;
	while(!pq.empty()){
		int p=pq.top();
		pq.pop();
		if(posx>=x.size()&&posy>=y.size()){
			sum+=p;
		}else if(posx>=x.size()){
			sum+=p*(100-y[posy++])/100;
		}else if(posy>=y.size()){
			sum+=max(0,p-x[posx++]);
		}else{
			int xx=max(0,p-x[posx]);
			int yy=p*(100-y[posy])/100;
			if(xx<=yy){
				sum+=xx;
				posx++;
			}else{
				sum+=yy;
				posy++;
			}
		}
	}
	cout<<sum<<"\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}