Friday, November 15, 2024
Sponsors

Tag: Codeforces Round #415 (Div. 2)

Codeforces Round #415 (Div....

Java
import java.util.*; public class C{ final int MOD = (int)1e9 +...
Read more

Codeforces Round #415 (Div....

C/C++
#include <cstdio> using namespace std; #define ff fflush(stdout) #define mid (lef+rig>>1) int n,...
Read more

Codeforces Round #415 (Div....

Uncategorized
#include <bits/stdc++.h> using namespace std; long long n,a,r,m=1e9+7,sum=0; int main(){...
Read more

Codeforces Round #415 (Div....

Uncategorized
#include<bits/stdc++.h> using namespace std; int64_t n,f,k,l,i,w,s,a; int main(){ for(cin>>n>>f;i<n;i++)cin>>k>>l,w=min(k,l),a=min(2*k,l)-w,s+=w; sort(a,a+n); for(i=0;i<n;i++)s+=i<f?a:0; cout<<s; }
Read more

Codeforces Round #415 (Div....

C/C++
#include <cstdio> int n,k,sum=0,mark; int main() { scanf("%d%d",&n,&k); for(int i=1;i<=n;i++)scanf("%d",&mark),sum+=mark; mark=(n*k-sum)*2-n; if(mark>0)printf("%d",mark); else printf("0"); }
Read more

Advertisement

spot_img

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016