結果

問題 No.1708 Quality of Contest
ユーザー snukesnuke
提出日時 2021-10-27 05:02:49
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 138 ms / 2,000 ms
コード長 2,943 bytes
コンパイル時間 2,374 ms
コンパイル使用メモリ 213,000 KB
実行使用メモリ 16,392 KB
最終ジャッジ日時 2024-10-06 20:05:44
合計ジャッジ時間 7,005 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 3 ms
5,248 KB
testcase_04 AC 4 ms
5,248 KB
testcase_05 AC 4 ms
5,248 KB
testcase_06 AC 4 ms
5,248 KB
testcase_07 AC 4 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 120 ms
16,392 KB
testcase_10 AC 97 ms
12,824 KB
testcase_11 AC 125 ms
9,808 KB
testcase_12 AC 121 ms
10,712 KB
testcase_13 AC 112 ms
9,580 KB
testcase_14 AC 124 ms
11,160 KB
testcase_15 AC 135 ms
15,372 KB
testcase_16 AC 135 ms
14,768 KB
testcase_17 AC 122 ms
12,588 KB
testcase_18 AC 125 ms
12,668 KB
testcase_19 AC 123 ms
12,716 KB
testcase_20 AC 122 ms
12,276 KB
testcase_21 AC 127 ms
13,004 KB
testcase_22 AC 122 ms
12,064 KB
testcase_23 AC 138 ms
14,660 KB
testcase_24 AC 95 ms
8,908 KB
testcase_25 AC 95 ms
7,732 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>;
using P = pair<int,int>; using vp = vc<P>;
int getInt(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

struct Solver {
  void solve() {
    int n,m,x;
    scanf("%d%d%d",&n,&m,&x);
    vvl d(m);
    rep(i,n) {
      int a,b;
      scanf("%d%d",&a,&b);
      d[b-1].pb(a);
    }
    vl s;
    rep(i,m) {
      sort(rrng(d[i]));
      if (sz(d[i])) d[i][0] += x;
      s.insert(s.end(), rng(d[i]));
    }
    sort(rrng(s));
    s.insert(s.begin(), 0);
    rep(i,n) s[i+1] += s[i];
    ll ans = 0;
    int k;
    scanf("%d",&k);
    rep(i,k) ans += s[getInt()];
    cout<<ans<<endl;
  }
};

int main() {
  int ts = 1;
  // scanf("%d",&ts);
  rrep(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0