Submission #3257

#TimeUsernameProblemLanguageResultExecution timeMemory
3257joonas앱 (KOI13_app)C++98
0 / 21
0 ms1672 KiB
#include <iostream> #include <algorithm> using namespace std; int Costs[100], Mbyte[100], res[100]; int main(){ int i, j, N, M; cin >> N >> M; for(i=0; i < N; ++i){ cin >> Mbyte[i]; res[i] = Mbyte[i]; } for(i=0; i < N; ++i){ cin >> Costs[i]; res[i] += Costs[i]; } for(i=0; i < N; ++i){ for(j=0; j < N; ++j){ if( res[i] < res[j] ){ swap( Costs[i], Costs[j] ); swap( Mbyte[i], Mbyte[j] ); swap( res[i], res[j] ); } else if( res[i] == res[j] ){ if( Costs[i] < Costs[j] ){ swap( Costs[i], Costs[j] ); swap( Mbyte[i], Mbyte[j] ); } } } } int Msum=0, Csum=0; for(i=0; i < N; ++i){ if( Msum < M ){ Msum += res[i]; Csum += Costs[i]; } else { cout<< Csum <<'\n'; break; } } return 0; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...