#include <iostream> #include <algorithm> using namespace std; int main() { int A[50]; int B[50]; int N; cin >> N; for (int i = 0; i < N; i++) cin >> A[i]; for (int i = N; i < 50; i++) A[i] = 1000; for (int i = 0; i < N; i++) cin >> B[i]; for (int i = N; i < 50; i++) B[i] = 1000; sort(A,A + 50); sort(B,B + 50); int S = 0; for (int i = 0; i < N; i++) S += A[i] * B[N - i - 1]; cout << S; return 0; }
# include < iostream > # include < vector > using namespace std ; int main ( ) { vector < int > Stick ; Stick . push_back ( 64 ) ; int Target ; cin > > Target ; int Last = 0 ; while ( true ) { if ( Target = = 64 ) break ; int Sum = 0 ; for ( int i = 0 ; i < Stick . size ( ) ; i + + ) Sum + = Stick [ i ] ; if ( Target = = Sum ) break ; else if ( Target < Sum ) { Stick [ Last ] / = 2 ; Sum = 0 ; for ( int i = 0 ; i < Stick . size ( ) ; i + + ) Sum + = Stick [ i ] ; if ( Target < = Sum ) continue ; else Stick . push_back ( Stick [ Last + + ] ) ; } } cout < < Stick . size ( ) ; ...
댓글
댓글 쓰기