首页 > 代码库 > Codeforces Round #280 (Div. 2) c
Codeforces Round #280 (Div. 2) c
/** * @brief Codeforces Round #280 (Div. 2) c * @file c.cpp * @author mianma * @created 2014/12/02 14:38 * @edited 2014/12/02 14:38 * @type math * @note * TL occured with cost n^2; * so cost < nlgn sort will ac * @note */ #include <fstream> #include <iostream> #include <cstring> #include <algorithm> #include <iomanip> #include <cstdlib> using namespace std; #define max(a, b) ((a) > (b) ? (a) : (b)) #define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) ((a) > 0 ? (a) : (0 - (a))) #define CLR(vec) memset(vec, 0, sizeof(vec)) #ifdef DEBUG ifstream in; ofstream out; #define CIN in #define COUT out #else #define CIN cin #define COUT cout #endif #define MAXN 100010 int n, r, avg; long long int ans; long long int tot; long long int curr; struct exam{ int grade; int cost; }; struct exam table[MAXN]; static inline int cmp(const void *lft, const void *rht){ return (((const struct exam *)lft)->cost - ((const struct exam*)rht)->cost ); } int main(void){ ios_base::sync_with_stdio(0); #ifdef DEBUG CIN.open("./in", ios::in); COUT.open("./out", ios::out); #endif CIN >> n >> r >> avg; for(int i = 0; i < n; i++){ CIN >> table[i].grade >> table[i].cost; curr += table[i].grade; } tot = n * (long long int )avg - curr; if(tot <= 0 ){ COUT << ans << "\n"; return 0; } /*sort*/ qsort(table, n, sizeof(table[0]), cmp); ans = 0; /*greedy*/ for(int i = 0; i < n && tot; i++){ long long int cnt; cnt = min(r - table[i].grade, tot); tot -= cnt; ans += cnt * table[i].cost; } COUT << ans << "\n"; return 0; }
Codeforces Round #280 (Div. 2) c
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。