https://www.acmicpc.net/problem/1049
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> v;
vector<int> s;
int n,m;
int main(int argc, char** argv)
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a,b;
cin>>n>>m;
for (int i = 0; i < m; ++i)
{
cin>>a>>b;
v.push_back(a);
s.push_back(b);
}
sort(v.begin(),v.end());
sort(s.begin(),s.end());
if(s[0]*6<=v[0]) cout<<s[0]*n<<"\n";
else if(n<6) cout<<min(v[0],s[0]*n)<<"\n";
else cout<<min(((n/6)+1)*v[0],(n/6)*v[0]+(n%6)*s[0])<<"\n";
return 0;
}
'알고리즘 공부' 카테고리의 다른 글
백준 9998 블록쌓기[binary Search] (0) | 2020.05.21 |
---|---|
백준 2631 줄세우기 [LIS] (0) | 2020.05.21 |
백준 1037 약수 (0) | 2020.05.21 |
백준 1026 보물[sort] (0) | 2020.05.21 |
백준 1018 체스판 다시 칠하기 [Brute Force] (0) | 2020.05.21 |
댓글