Codeforces Round #560 (Div. 3)

最新推荐文章于 2024-09-22 19:01:00 发布

weixin_30835923

最新推荐文章于 2024-09-22 19:01:00 发布

阅读量66

点赞数

原文链接：http://www.cnblogs.com/Kaike/p/10869428.html

版权

Codeforces Round #560 (Div. 3)

E. Two Arrays and Sum of Functions

Description

You are given two arrays

Let's define a function

Your task is to reorder the elements (choose an arbitrary order of elements) of the array

Input

The first line of the input contains one integer

The second line of the input contains

The third line of the input contains

output

Print one integer — the minimum possible value of

Examples

Input

5
1 8 7 2 4
9 7 2 9 3

Output

646

正确解法：

虽然没看懂题，但是解法是把 c[i] = i *（n-i+1）*a[i] 排序

b[i] 排序

ans+=c[i]*b[n-i+1];

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 #include <set>
 7 #include <map>
 8 #include <vector>
 9 #include <cctype>
10 #include <sstream>
11 using namespace std;
12 typedef long long ll;
13 const int inf=0x7fffffff;
14 const int N=200000+100;
15 const int M=50000+10;
16 const int MOD=998244353;
17 const double PI=acos(-1.0);
18 int n,a[N],b[N];
19 ll c[N],ans=0;
20 int main()
21 {
22     scanf("%d",&n);
23     for(int i=1;i<=n;i++)
24     {
25         scanf("%d",&a[i]);
26         c[i]=i*(n-i+1ll)*a[i];
27     }
28     for(int i=1;i<=n;i++)
29         scanf("%d",&b[i]);
30     sort(c+1,c+n+1);
31     sort(b+1,b+n+1);
32     for(int i=1;i<=n;i++)
33     {
34         ans+=(c[i]%MOD)*b[n-i+1];
35         ans%=MOD;
36     }
37     printf("%lld\n",ans);
38 
39     return 0;
40 }

View Code

F2. Microtransactions (hard version)

Description

Ivan plays a computer game that contains some microtransactions to make characters look cooler. Since Ivan wants his character to be really cool, he wants to use some of these microtransactions — and he won't start playing until he gets all of them.

Each day (during the morning) Ivan earns exactly one burle.

There are

Ivan can order any (possibly zero) number of microtransactions of any types during any day (of course, if he has enough money to do it). If the microtransaction he wants to order is on sale then he can buy it for

There are also

Ivan wants to order all microtransactions as soon as possible. Your task is to calculate the minimum day when he can buy all microtransactions he want and actually start playing.

Input

The first line of the input contains two integers

The second line of the input contains

The next

output

Print one integer — the minimum day when Ivan can order all microtransactions he wants and actually start playing.

Examples

Input

5 6
1 2 0 2 0
2 4
3 3
1 5
1 2
1 5
2 3

Output

正确解法：

题目大意是 kk想去买所有她想要的玩具，但她一天只能得到一块钱，一个玩具两块钱。

但是商场有时会打折，在特定天数特定玩具一块钱。

求kk最早能得到所有她想要玩具的天数。

我感受到了二分的重要之处，枚举（玩具个数，玩具个数*2）的天数。

倒着找：在最后一天买了最后一天能打折的玩具，能买多少买多少。

如果买完能打折的玩具后，当天钱大于等于当天的话，也就是说没有花，就要去买玩具的原价。因为你在当天不可能有比当天多的钱。

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 #include <set>
 7 #include <map>
 8 #include <vector>
 9 #include <cctype>
10 #include <sstream>
11 using namespace std;
12 typedef long long ll;
13 const int inf=0x7fffffff;
14 const int N=400000+100;
15 const int M=50000+10;
16 const int MOD=998244353;
17 const double PI=acos(-1.0);
18 int n,m;
19 int a[N],b[N];
20 vector<int>ve[N];
21 bool check(int x,int y)
22 {
23     int re=x,flag=0;
24     for(int i=1;i<=n;i++)   b[i]=a[i];
25     for(int i=x;i>=1;i--)
26     {
27         for(int j=0;j<ve[i].size();j++)
28             while(b[ve[i][j]]&&re)
29             {
30                 re--;   b[ve[i][j]]--;
31                 y--;
32             }
33         if(re>=i)   {re--;  flag++;}
34     }
35     if(flag/2>=y)   return 1;
36     return 0;
37 }
38 int main()
39 {
40     int sum=0,ans=inf;
41     scanf("%d %d",&n,&m);
42     for(int i=1;i<=n;i++)
43     {
44         scanf("%d",&a[i]);
45         sum+=a[i];
46     }
47     for(int i=1;i<=m;i++)
48     {
49         int aa,bb;
50         scanf("%d %d",&aa,&bb);
51         ve[aa].push_back(bb);
52     }
53     int l=sum,r=sum*2;
54     while(l<=r)
55     {
56         int mid=l+r >>1;
57         if(check(mid,sum))
58         {
59             ans=min(ans,mid);
60             r=mid-1;
61         }
62         else    l=mid+1;
63     }
64     cout<<l<<endl;
65 
66     return 0;
67 }