제출 #1060149

#제출 시각아이디문제언어결과실행 시간메모리
1060149Zbyszek99Cloud Computing (CEOI18_clo)C++17
0 / 100
1 ms604 KiB
#include <bits/stdc++.h> #define ll long long #define ld long double #define ff first #define ss second #define pii pair<int,int> #define pll pair<long long, long long> #define pb push_back #define rep(i, b) for(int i = 0; i < (b); ++i) #define rep2(i,a,b) for(int i = a; i <= (b); ++i) #define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c) #define count_bits(x) __builtin_popcountll((x)) #define all(x) (x).begin(),(x).end() #define size(x) (int)(x).size() #define forall(it,x) for(auto& it:(x)) using namespace std; //mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());} //ll rand(ll a, ll b) {return a + (mt() % (b-a+1));} const int INF = 1e9+50; const ll INF_L = 1e18+40; const ll MOD = 1e9+7; void solve() { int n,m; cin >> n >> m; vector<pii> div; vector<pii> zam; rep(i,n) { int c,f,v; cin >> c >> f >> v; div.pb({v,f}); zam.pb({v,f}); } sort(all(zam)); reverse(all(zam)); int ans = 0; rep(i,m) { pii mini = {1e9,-1}; rep(j,n) { if(div[j].ss >= zam[i].ss) { mini = min(mini,{div[j].ff,i}); } } if(-mini.ff+zam[i].ff > 0) { ans += -mini.ff+zam[i].ff; div[mini.ss] = {2e9,-1}; } } cout << ans << "\n"; } int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); //random(); int t = 1; // cin >> t; while(t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...