Search is not available for this dataset
name stringlengths 2 112 | description stringlengths 29 13k | source int64 1 7 | difficulty int64 0 25 | solution stringlengths 7 983k | language stringclasses 4
values |
|---|---|---|---|---|---|
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
typedef pair<int, int> pii;
typedef long long ll;
int main()
{
while (1)
{
int N, M; cin >> N >> M;
if (N == 0) return 0;
vector<pii> PD;
rep(i, 0, N)
{
int d, p; cin >> d >> p;
PD.push_back(pii(p, d));
}
sort(... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | while 1:
N,M = map(int,raw_input().split())
if N == M == 0: break
DP = [map(int,raw_input().split()) for _ in xrange(N)]
DP = sorted(DP, key = lambda x:x[1], reverse = True)
ans = 0
for i in xrange(N):
if M-DP[i][0] >= 0:
M -= DP[i][0]
else:
ans += DP[i][... | PYTHON |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
ll m;
int d[10000], p[10000];
int main() {
while(scanf("%d%lld",&n,&m)&&(n!=0||m!=0)) {
for (int i=0; i<n; i++) scanf("%d%d",&d[i],&p[i]);
vector<P> v;
for (int i=0; i<n; i++) v.push_back(P(p... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
using namespace std;
int main(){
int N,M;
while(cin>>N>>M,N||M){
int Expected[11]={0};
int sum=0;
int p,d;
for(int i=0;i<N;i++){
cin>>d>>p;
Expected[p]+=d;
}
for(int i=10;i>=0;i--){
if(Expected[i]<=M){
M-=Expected[i];
Expected[i]=0;
}
else{
Expected... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <map>
#include <algorithm>
using namespace std;
int main(){
int n, m, d, p, ans;
while( cin >> n >> m , n || m ){
ans = 0;
map<int,int> f;
for(int i=0 ; i <= 10 ; i++ ){
f[i] += 0;
}
for(int i=0 ; i<n ; i++ ){
cin >> d >> p;
f[p] += d;
}
for(int i=10 ; i >= 0 ;... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
int main(){
while(1){
int n,m;
cin>>n>>m;
if(n==0&&m==0) break;
vector<pair<int,int>> a;
int ans=0;
lp(i,n){
int b,c;
cin>>b>>c;
ans+=b*c;
a.push_back(make_pair(c,b));
}
sort(a.begin(),a.end());
reverse(a.b... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
long N, M;
while (cin >> N >> M && N != 0 || M != 0)
{
vector< pair<int,int> > dp(N);
long long ans = 0;
for (int i = 0; i < N; i++)
{
cin >> dp[i].second >> dp[i].first;
ans += dp[i].second * dp[i].first;
}
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import sys
while True:
n, m = map(int, sys.stdin.readline().split())
if n == 0 and m == 0:
break
route = []
for i in xrange(n):
d, p = map(int, sys.stdin.readline().split())
route.append([p, d])
route.sort(reverse=True)
count = 0
for c, l in route:
if l < m:
... | PYTHON |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.util.*;
public class Main{
static Scanner kbd = new Scanner(System.in);
public static void main(String[] args){
while(kbd.hasNext()){
int n = kbd.nextInt();
int m = kbd.nextInt();
if(!(n==0 && m==0)){
solve(n, m);
}
}
}
static void solve(int n, int m){
int[][] dis =... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n) {
vector<pair<int, int>>v;
int ans = 0;
for (int i = 0; i < n; i++) {
int d, p; cin >> d >> p;
ans += d*p;
v.push_back(make_pair(p, d));
}
sort(v.begin(), v.end());
int i =... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <cstdio>
#include <functional>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
int n, m;
P x[10000];
int main(){
while(scanf("%d%d", &n, &m), n){
rep(i, n){
int d, p;
scanf("%d%d", &d, &p);
x[i] = P(p, d);
}
sort(x, x + n, ... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import heapq
while True:
N,M = map(int, raw_input().split())
if N==M==0: break
q = []
for _ in xrange(N):
d,p = map(int, raw_input().split())
heapq.heappush(q, [p,d])
q = sorted(q, reverse=True)
for i in xrange(N):
if q[i][1] > M:
q[i][1] -= M
M = 0
break
else:
M -= ... | PYTHON |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<stdio.h>
int main(){
int n,m,p,i;
for( ; scanf("%d%d",&n,&m) , n|m ; printf("%d\n",p) ){
int f[12]={0};
for( i=n ; i-- ; f[p] += n )
scanf("%d%d",&n,&p);
p=0;
for( i=10 ; i >= 0 ; p += f[i]*i , i-- )
for( ; f[i] && m ; )
m--,f[i]--;
}
} | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #月曜五時間目 実践的プログラミング
#ソートして襲われてはいけない時には、できるだけ護衛をつけるようにすることが最適であるので
#ソートした後に左から貪欲に護衛をつけていって、お金がなくなったらそのまま何もしないと言う戦略で正解した。
#時間:15分
#Princess' Marriage
#学んだこと：ソートして貪欲に考える
#URL: https://onlinejudge.u-aizu.ac.jp/challenges/search/titles/2019
def solve():
N,M=map(int,input().split())
if N==0 and M==0:
#終了条件
... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
struct P{int p,d;};
bool cmp_x(const P& a, const P& b){
return a.p>b.p;
}
int main(void){
int n,m,d,p;
vector<P>ar;
P in;
while(cin >> n >> m,n|m){
ar.clear();
for(int i=0;i<n;i++){
cin >> in.d >> in.p;
ar.pu... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ipair;
typedef priority_queue<ipair> pq;
int main()
{
int n, m;
while(cin >> n >> m, n|m)
{
pq q;
int res = 0;
for(int i=0; i<n; i++)
{
int d, p;
cin >> d >> p;
res += d... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | while 1:
n, m = map(int,raw_input().split())
if (n,m) == (0,0):
break
num = [0 for i in range(11)]
for i in range(n):
d, p = map(int,raw_input().split())
num[p] += d
expectation = 0
for i in range(10):
if m >= num[10-i]:
m -= num[10-i]
else :
expectation += (num[10-i]-m)*(10-i)
m = 0
print exp... | PYTHON |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int N, M;
int sum;
vector<pii> pvec;
void solve() {
sort(pvec.begin(), pvec.end(), greater<pii>());
for (int i = 0; i < N; i++) {
pii p = pvec[i];
if (p.second <= M) {
M -= p.second;
sum -= p.first * p.second;
} else {
s... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
while (scanf("%d %d", &n, &m), n){
typedef pair<int, int> P;
vector<P> v;
int res = 0;
for (int i = 0; i < n; i++){
int a, b;
scanf("%d %d", &a, &b);
v.push_back(P(b, a));
res += a * b;
}
sort(v.begin(), v.end());
reverse(... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.util.NoSuchElementException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
#include<cstring>
#include<algorithm>
using namespace std; int d[11], n, m, i, a, b, sum, e;
int main() {
while (true) {
memset(d, 0, sizeof(d)); sum = 0;
cin >> n >> m; if (!n) { break; }
for (i = 0; i < n; i++) {
cin >> a >> b;
d[b] += a;
}
for (i = 10; i >= 0;i--){
e = min(d[i]... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | while 1:
N, M = map(int, input().split())
if N == M == 0:
break
S = []
for i in range(N):
S.append(list(map(int, input().split())))
S.sort(key=lambda x:x[1], reverse=True)
ans = 0
for d in S:
if M >= d[0]:
M -= d[0]
else:
d[0] -= M
... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <algorithm>
#define p first
#define d second
using namespace std;
int main() {
while(1) {
int n,m;
cin >> n >> m;
if(n == 0 && m == 0) break;
pair <int,int> pd[10001];
for(int i=0;i<n;i++) cin >> pd[i].d >> pd[i].p;
sort(pd,pd+n);
int ans = 0;
for(int i=n-1;i>=0;i--)
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
vector<pair<int,int> > d;
pair<int,int> k;
int n,m,a,b,sum;
while(1){
cin>>n>>m;
if(n==0)break;
d.clear();
for(int i=0;i<n;i++){
cin>>a>>b;
k.first=b*-1;
k.second=a;
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in)){
while(sc.hasNext()) {
int N=sc.nextInt();
int M=sc.nextInt();
if(N+M==0) break;
int[] ds = new int[... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
int main(){
while (1){
int N, M;
cin >> N >> M;
if (N == 0 && M == 0){
break;
}
vector<int> D(N), P(N);
for (int i = 0; i < N; i++){
cin >> D[i] >> P[i];
}
vector<int> sum(11, 0);
for (int i = 0; i < N; i++){
sum[P[i]]... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <algorithm>
#include <utility>
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,k,n) for(int i=k;i<n;i++)
using namespace std;
int main(){
int n,m;
while(cin>>n>>m and n>0){
pair<int,int> a[n]; rep(i,n) cin>>a[i].second>>a[i].first;
sort(a,a+n);
int i=n-1;
while(m>0 and i>=0){... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <iomanip>
#include <cmath>
#include <algorithm>
using namespace std;
int main() {
int N, M;
while (cin >> N >> M) {
if (N == 0) break;
long long res = 0;
vector<pair<long long, long long> > a(N);
for (int i = 0; i < N; ++i) c... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | while True:
n, m = map(int, input().split())
ex = [0] * 11
if n == 0: break
for i in range(n):
d, p = map(int, input().split())
ex[p] += d
ex.reverse()
for i in range(len(ex)):
m -= ex[i]
if m <= 0:
ex[i] = abs(m)
break
else:
... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | while(True):
N, M = map(int, input().split())
if(N == 0 and M == 0):
break
DP = []
for i in range(N):
DP.append([int(_) for _ in input().split()])
DP.sort(key=lambda x:x[1])
DP.reverse()
for i in range(N):
decr = min(M, DP[i][0])
M -= decr
DP[i][0] ... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
#include<utility>
#include<algorithm>
using namespace std;
int main(){
int n,money;
while(cin >>n>>money &&( n>0||money>0)){
pair<int,int> PD[10010];
int p,d;
for(int i=0;i<n;i++){
cin >>d>>p;
PD[i]=make_pair(p,d);
}
sort(PD,PD+n);
int need;
int ans=0;
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws IOException {
// TODO ?????????????????????????????????????????????
BufferedReader br = new BufferedReader(new InputStreamReader(... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int main(){
int n,m,d,p,o;
typedef pair<int,int> ma;
int i,j,k;
cin >> n >> m;
while(n!=0||m!=0){
vector <ma> map;
ma b;
for(i=0;i<n;i++) {
cin >> d >> p;
b.first=p;b.second=d;
map.p... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
class D implements Comparable<D>{
int l, p;
D(int l, int p) {
this.l = l;
this.p = p;
}
@Override
public int compareTo(D o) {
return o.p - this.p;
}
@Override
public String toString() {
return "(" + l + ", " + p + ")... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 |
#include<iostream>
using namespace std;
int ways[11];
int main()
{
loop:
int n, m;
for(int i = 0; i < 11; i++)
ways[i] = 0;
cin >> n >> m;
if(!n)
return 0;
for(int i = 0; i < n; i++)
{
int d, p;
cin >> d >> p;
ways[p] += d;
}
for(int i = 10; i > 0; i--)
{
if(ways[i] < m)
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<bits/stdc++.h>
#define P pair<int,int>
using namespace std;
signed main(){
int a,b;
P c[10000];
while(scanf("%d%d",&a,&b),a|b){
for(int d=0;d<a;d++){
int e,f;
scanf("%d%d",&e,&f);
c[d]=P(f,e);
}
sort(c,c+a);
reverse(c,c+a);
int s=0;
for(int g=0;g<a;g++){
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
int N;
long long int M;
while(1){
cin>>N>>M;if(N==0&&M==0)break;
int D[10002][2]={};
int P[10001]={};
for(int i=0;i<N;i++)
cin>>D[i][0]>>D[i][1];
int c=0;
for(int i=0;i<N;i++)
for(int j=N-1;j>i;j--)
{if(D[j][1]>D[j-1][1]){
int t=D[j][1];D[j][1]... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n, m;
while(cin >> n >> m, n+m){
vector<pair<int, int>> v(n);
for(int i=0; i< n; i++) cin >> v[i].second >> v[i].first;
sort(v.begin(), v.end());
for(int i=v.size()-1; 0 <= i; i--){
if(n != 0){
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <stdio.h>
int main(void){
int a,b,n,m,k,p[11];
while(scanf("%d %d",&n,&m),n||m){
k=0;
for(int i=0;i<11;i++)p[i]=0;
while(n--){
scanf("%d %d",&a,&b);
p[b]+=a;
}
for(int i=10;i>=0;i--){
if(m>=p[i]){
m-=p[i];
p[i]=0;
}else{
p[i]-=m;
m=0;
break;
}
}
for(int i=1;i... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
while(true){
long n,m;
cin>>n>>m;
if(n==0&&m==0)break;
long sum=0;
vector<pair<long,long>> d(n);
for(int i=0;i<n;i++){
cin>>d[i].second>>d[i].first;
sum+=d[i].first*d[i].second;;
}
sort(d.begin(),d.end()... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
int cal(int M, priority_queue<pair<int, int>>& pq) {
int res = 0;
while(!pq.empty()) {
int P = pq.top().first;
int D = pq.top().second;
pq.pop();
if(M > 0) {
if(M >= D) {
M = M - D;
}else{
res += (D - M) * P;
M = 0;
}
}else{
res += D ... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
using namespace std;
int main()
{
int n,m;
while(cin>>n>>m,n)
{
int ps[11];
for(int i = 0; i < 11; ++i)
{
ps[i]=0;
}
for(int i = 0; i < n; ++i)
{
int d,p;
cin>>d>>p;
ps[p]+=d;
}
for(int i = 10; 0 <= i; --i)
{
if(m>=ps[i])
{
m-=ps[i];
ps[i]=0;
}
el... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
while(true){
int ans=0;
int n=sc.nextInt(), m=sc.nextInt();
ArrayList<State> al = new ArrayList<State>();
if(n==0 && m==0) break;
for(int i=0;i<n;i++)
al.add(new State(sc.nextIn... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.util.Collections;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
public void run() {
while(sc.hasNext()){
int n = sc.nextInt();
int m = sc.nextInt();
if(n == 0 && m == 0) break;
calc(n, m);
}
}
public void calc(int n, in... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct cell{int D,P;};
bool operator<(cell a, cell b){return a.P!=b.P?a.P>b.P:a.D>b.D;};
int main()
{
int N,M,D,P,p,i;
vector<cell> v;
while(cin>>N>>M,N||M){
v.resize(N);
for(i=0;i<N;i++){
cin>>D>>P;
v[i].D=D;
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | b=True
while b:
n,m=map(int,input().split())
if n==0 and m==0:
b=False
exit
else:
l=[]
for i in range(n):
l1=list(map(int,input().split()))
l1=l1[::-1]
l.append(l1)
l=sorted(l)
l=l[::-1]
s=0
for i in range(n):
s+=l[i][0]*l[i][1]
for i in range(n):
... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | roadcnt,money = (int(n) for n in input().split(" "))
while True:
road = []
for r in range(roadcnt):
road.append([int(n) for n in input().split(" ")])
road = sorted(road,key=lambda x:x[1])
while money > 0 and len(road) > 0:
if road[-1][0] - money < 0:
money -= road[-1][0]
... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int M = in.nextInt();
int count[] = new int[11];
while(N != 0 || M != 0){
for(int i = 0;i <= 10;i++) count[i] = 0;
int countP = 0;
for(int i = 0;i < N;i++... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
while (cin >> N >> M, N) {
int D, P, res = 0;
int Ps[11] = {0};
for (int i=0; i<N; ++i) {
cin >> D >> P;
res += D ... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | while True:
n,m = map(int, input().split(" "))
if n+m == 0:
break
dp = []
for i in range(n):
d,p = map(int, input().split(" "))
dp.append((d,p))
ans = 0
for d,p in sorted(dp, key=lambda x: x[1], reverse=True):
if m == 0:
ans += p * d
elif m < d:
ans += p * (d - m)
m = 0
else:
m -= d
print... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
#include<algorithm>
#include<vector>
#include<utility>
using namespace std;
typedef pair <int,int> pii;
int main(){
int n,m;
while(cin>>n>>m,n){
vector<pii> d(n);
for(int i=0;i<n;i++)cin>>d[i].second>>d[i].first;
sort(d.begin(),d.end(),greater<pii>());
int ans=0;
for(int i... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | readline = open(0).readline
while 1:
N, M = map(int, readline().split())
if N == M == 0:
break
Q = []
for i in range(N):
d, p = map(int, readline().split())
Q.append((p, d))
Q.sort(reverse=1)
ans = 0
for p, d in Q:
if M >= 0:
x = min(M, d)
... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (!n) return 0;
int l[12] = {};
for (int i = 0; i < n; ++i) {
int d, p;
cin >> d >> p;
l[p] += d;
}
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
#include<algorithm>
using namespace std;
typedef pair<int,int> P;
int N,M;
P t[10000];
int main(){
while(1){
cin>>N>>M;
if(N==0&&M==0)break;
for(int i=0;i<N;i++)cin>>t[i].second>>t[i].first;
sort(t,t+N);
reverse(t,t+N);
int ans=0;
for(int i=0;i<N;i++){
int d=min(M... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.util.*;
public class Main{
int n,m;
int[] d,p;
public static void main(String[] args){
new Main().solve();
}
void solve(){
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
while(n!=0){
m = sc.nextInt();
d = new int[n];
p = new int[n];
for(int i=0 ;i<n; i+... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <algorithm>
using namespace std;
class A{
public:
int D, P;
bool operator <(const A &a) const {
if(P != a.P) return P > a.P;
return D > a.D;
}
};
int main() {
while(1) {
int N, M;
A a[10000];
int sum;
cin >> N >> M;
if(N == 0 && M == 0) break;
su... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<(int)n;i++)
using namespace std;
int main ()
{
int n,m;
while(cin>>n>>m&&n)
{
vector<pair<int,int > >a;
pair<int,int> x;
rep(i,n){
cin>>x.second>>x.first;
a.push_back(x);
}
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
int ans=0;
r... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | da = list(map(int,input().split()))
k = [[0 for i in range(2)]for j in range(10001)]
i = 0
su = 0
j = 0
while da[0] + da[1] != 0:
i = 0
su = 0
j = 0
for i in range(da[0]):
k[i][0],k[i][1] = map(int,input().split())
k = sorted(k,key = lambda x: x[1],reverse = True)
while j != i + 1:
if da[1] > k[j][0]:
... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<functional>
using namespace std;
typedef pair<int,int> P;
int main(){
int n,m;
while(cin>>n>>m && n){
vector<P> data;
int ans=0;
for(int i=0;i<n;i++){
int d,p;
cin>>d>>p;
data.push_back(P(p,d));
ans+=d*p;
}
sort(d... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
#define F(i,N) for(int i=0;i<(int)N;i++)
using namespace std;
int main(){
int n,j,a[11],q,b,c,d,e;
while(cin>>q>>b){
if(q==0&&b==0)break;
int sum=0;
F(i,11)a[i]=0;
F(i,q){cin>>c>>d;a[d]+=c;}
for(int i=10;i>=0;i--){
e=a[i];
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int N,M;
pair<int,int> PD[10010];
int main() {
while (cin >> N >> M && N) {
int d,p;
for (int i=0; i<N; ++i) {
cin >> d >> p;
PD[i] = make_pair(p,d);
}
sort(PD,PD+N);
reverse(PD,PD+N);
int S = 0;
for... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
#include<queue>
#include<utility>
using namespace std;
int main(){
int n,m;
while(cin>>n>>m,n){
int a,b,ans=0;
priority_queue< pair<int,int> > c;
for(int i=0;i<n;i++){
cin>>a>>b;
c.push(make_pair(b,a));
}
while(!c.empty()){
if(c.top().second>m){
c.pus... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | while True:
N,M = map(int,input().split())
if N == M == 0:
break
else:
L = []
for i in range(N):
L.append(list(map(int,input().split())))
L = sorted(L, key = lambda x:x[1])
L.reverse()
ans = 0
for i in range(len(L)):
if M > 0:
if M-L[i][0] >= 0:
M -= L[i][... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Pair;
int n;
int m;
Pair ps[114514];
int main() {
while (1) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0) return 0;
for (int i=0; i<n; i++) {
int d;
int p;
scanf("%d%d", &d, &p);
ps[i] = Pair(p, d);
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <cstdio>
#include <iostream>
#include <utility>
using namespace std;
int main(){
while(1){
int n, d[10000], p[10000];
long m, ans=0;
//入力
scanf(" %d %ld", &n, &m);
if(n==0) break;
for(int i=0; i<n; ++i){
scanf(" %d %d", &d[i], &p[i]);
ans += d[i]*p[i];
}
//期待値の最も高いところから順に護衛
for(i... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | while True:
N,M = map(int,input().split())
if N == 0:
break
expect = 0
a = []
exsum = 0
for i in range(N): #二次元配列を作る
a.append(list(map(int,input().split())))
exsum += a[i][0]*a[i][1] #誰も雇わなかった場合の期待値
b = sorted(a, key=lambda x: x[1]) #危険度の高い区間ほど後ろにくるように並べる
i = N-1
... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N,M;
for(;;){
scanf("%d%d",&N,&M);
if(N==0&&M==0) break;
int d,p,len=0;
vector<pair<int,int>> ds(N);
for(auto &pa : ds){
scanf("%d%d",&d,&p);
pa=make_pai... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int n, m, d, p, res, cnt[11];
while (cin >> n >> m, n | m) {
res = 0;
for (int i = 0; i < 11; ++i)
cnt[i] = 0;
for (int i = 0; i < n; ++i) {
cin >> d >> p;
cnt[p] += d;
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
typedef pair<int,int>pii;
int main(){
int n,m;
while(scanf("%d%d",&n,&m),n||m){
vector<pii>V(n);
for(int i=0;i<n;i++){
int d,p;
scanf("%d%d",&d,&p);
V[i]=pii(p,d);
}
sor... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m && n + m) {
vector<pair<int,int> > pd(n);
int ans = 0;
for (int i = 0; i < n; ++i) {
cin >> pd[i].second >> pd[i].first;
ans += pd[i].first * pd[i].second;
}
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
int n,m;
int d,p;
int sum;
int i1,i2;
while(1){
cin >> n >> m;
if(n+m==0) break;
vector<pair<int, int> > michi;
sum=0;
for(i1=0;i1<n;i1++){
cin >> d >> p;
michi.push_back(make_pair(p,d));
sum+=... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in)){
while(sc.hasNext()) {
int n = sc.nextInt();
int m = sc.nextInt();
if(n + m == 0) break;
int[] ds = new int[11];
while(n-- != 0) {
int d = sc.nextInt();
... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | while True:
N, M = map(int, input().split()) # 宿の数N, 予算M
if N == 0 and M == 0:
break
dangers = {} # Pをkeyとして頑張る
for _ in range(N):
distance, P = map(int, input().split())
if P not in dangers:
dangers[P] = distance
else:
... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
typedef pair<int, int> P;
int main() {
for(int N, M; cin >> N >> M, N || M; ) {
vector<P> data;
int s = 0;
for(int i = 0; i < N; i++) {
int d, p;
cin >> d >> p;
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | while True:
n, m = map(int, input().split())
if n == m == 0:
break
li = list()
total = 0
for i in range(n):
d, p = map(int, input().split())
li.append((p, d))
total += p * d
li.sort(reverse = True)
for p, d in li:
if d <= m:
total -= p * ... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int N, M;
while(cin >> N >> M && (N|M)) {
P ps[N];
for(int i=0; i<N; i++) {
cin >> ps[i].second >> ps[i].first;
ps[i].first = -ps[i].first;
}
sort(ps, ps+N);
for(int i=0; i<N; i++) {
ps[i].... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | while True:
n,m=map(int,input().split())
if n==0 and m==0:
break
pd=[list(map(int,input().split()))[::-1] for i in range(n)]
pd.sort()
pd.reverse()
ans=0
for i in pd:
if m>i[1]:
m-=i[1]
elif m>0:
ans+=i[0]*(i[1]-m)
m=0
else:... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | while True:
n, m = map(int, input().split())
if n == 0 and m == 0:
break
sections = []
for i in range(n):
d, p = map(int, input().split())
sections.append([p, d])
sections.sort()
sections.reverse()
e = 0
for p, d in sections:
if d <= m:
m -= d... | PYTHON3 |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
int main() {
int N,M;
while(scanf("%d %d",&N,&M),N) {
priority_queue<P> Q;
for(int i=0;i<N;i++) {
int d,p;
scanf("%d %d",&d,&p);
Q.push(P(p,d));
}
int sum=0;
while(!... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<bits/stdc++.h>
using namespace std;
struct S{
int d,p;
};
bool operator<(S a,S b){
return a.p<b.p;
}
int n,m;
vector<S> dp;
void init(){
dp.clear();
}
bool input(){
cin>>n>>m;
if(n==0&&m==0)return false;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
dp.push_back((S){a,b});
}
return t... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.util.*;
import static java.lang.System.*;
public class Main {
Scanner sc = new Scanner(in);
class A {
int d, p;
A(int d, int p) {
this.d = d;
this.p = p;
}
}
void sort(A[] a) {
int n = a.length;
for (int i = n-1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (a[j].p < a[j+1... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
using namespace std;
int N, M;
int d, p, L, s, c;
pair<int, int> x[10000];
int main()
{
while(cin >> N >> M && N!=0)
{
L=0;
for(int i=0; i<N; i++)
{
cin >> d >> p;
x[i]=make_pair(p, d);
L+=d;
}
sort(x, x+N);
s=0;
if(M<L)
{
c=0;
for(int i=0; i<N; i++)
{
if... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, M;
while (cin >> N >> M && N > 0) {
vector<pair<int, int> > A;
A.reserve(N);
for (int i = 0; i < N; i++) {
int d, p;
cin >> d >> p;
pair<int, int> a = make_pair(p, d);
A.push_back... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
#include<string>
using namespace std;
int d[10000],p[10000];
int main(){
int n,m;
while(true){
cin>>n>>m;
if(n==0&&m==0)
break;
int load=0;
for(int i=0;i<n;i++){
cin>>d[i]>>p[i];
load+=d[i];
}
if(load<=m)
cout<<"0"<<endl;
else{
int count=0;
for(int i=0;i<n-1;i++){
for(int j=n-... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.util.*;
public class Main {
static Scanner in = new Scanner(System.in);
public static void main(String[] args) {
while(true){
int n =in.nextInt();
long m = in.nextInt();
if(n+m==0)break;
ArrayList<Data> list = new ArrayList<Data>();
for(int i=0;i<n;i++)list.add(new Data(in.nextInt(), in.... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
using namespace std;
int main(){
int m,n;
n=1;
while(n>0){
cin >> n >> m;
if(n==0) break;
int d[n],p[n];
int s=0;
for(int i=0;i<n;i++){
cin >> d[i] >> p[i];
s += d[i]*p[i];
}
for(int i=0;i<n;i++){
for(int j=i;j<n;j++){
int a,b;
if(p[j]<p[i]... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
for(int N, M; cin >> N >> M && N; ) {
vector<pair<int, int>> roads;
int danger = 0;
for(int i = 0; i < N; i++) {
int d, p;
cin >> d >> p;
roads.push_back(make_pair(p, d));
danger += d * p;
}
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
Scanner sc;
class Pair {
int f;
int s;
Pair(int f, int s) {
this.f = f;
this.s = s;
}
}
void run() {
for ( ;; ) {
int n = ni();
int m = ni();
if ( ( n | m ) =... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import static java.lang.Integer.parseInt;
/**
* Princess's Marriage - Accepted
*/
public class Main {
public static void main(String[] args) throws IOException {
Buf... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #import<cstdio>
int main(){int n,m,p,i;for(;scanf("%d%d",&n,&m),n|m;printf("%d\n",p)){int f[12]={0};for(i=n;i--;f[p]+=n)scanf("%d%d",&n,&p);p=0;for(i=10;i>=0;p+=f[i]*i,i--)for(;f[i]&&m;)m--,f[i]--;}} | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<cmath>
#include<functional>
#include<algorithm>
#define INF (1<<29)
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int p[11];
int ... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | import java.util.*;
public class Main {
public static Scanner sc = new Scanner(System.in);
public static int N, M;
public static void main(String[] args) {
while (true) {
N = sc.nextInt();
M = sc.nextInt();
if (N == 0 && M == 0)
break;
ArrayList<Edge> es = new ArrayList<Edge>();
for (... | JAVA |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<cstdio>
#include<algorithm>
using namespace std;
int main(){
pair<char,int> d_p[10000];
for(int n,m;scanf("%d%d",&n,&m),n;){
int psum=0;
for(int i=0;i<n;i++){
scanf("%d%d",&d_p[i].second,&d_p[i].first);
psum+=d_p[i].first*d_p[i].second;
}
sort(d_p,d_p+n);
for(int i=n-1;i>=0;i--){
if(m==0... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
for(int n,m;cin>>n>>m,n|m;){
pair<int,int> rs[n]; // (期待値,距離)
for(int i=0;i<n;i++) cin>>rs[i].second>>rs[i].first;
sort(rs,rs+n,greater<pair<int,int>>());
int res=0;
for(int i=0;i<n;i++){
res+=rs[i].first*max(rs[i].second-m,0)... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
using namespace std;
int main(){
int N,M;
while(cin>>N>>M,N||M){
int Expected[11]={0};
int sum=0;
int p,d;
for(int i=0;i<N;i++){
cin>>d>>p;
Expected[p]+=d;
}
for(int i=10;i>=0 && M>=0;i--){
if(Expected[i]<=M){
M-=Expected[i];
Expected[i]=0;
}
else{
... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
using namespace std;
int main(){
int N, M;
int Di, Pi;
int P[11], sum;
int cnt;
while (1){
cin >> N >> M;
if (N == 0 && M == 0) break;
for (int i = 0; i < 11; i++) P[i] = 0;
sum = 0;
cnt = 10;
for (int i = 0; i < N; i++){
cin >> Di >> Pi;
P[Pi] += Di;
}
while (cnt !... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
struct D {
int d, p;
D() {}
D(int d, int p) : d(d), p(p) {}
};
bool operator >(const D& d1, const D& d2) {
return d1.p > d2.p;
}
int main() {
int N, M;
while (cin >> N >> M, N || M) {
vector<D> v;
for (... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <math.h>
#include <map>
#include <numeric>
using namespace std;
typedef long long int ll;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
while(1){
int n,m; cin >> n >> m;
if(n==0&&m==0)break;
vector<pair<int,int>> v... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
using namespace std;
int main(){
int n,m;
while(cin>>n>>m,n){
int table[11]={0};
int d,p;
int max = 0;
for(int i=0;i<n;i++){
cin>>d>>p;
table[p]+=d;
if(max < p) max = p;
}
for(int i=max;i>=0;i--){... | CPP |
p01144 Princess's Marriage | Princess'Marriage
Marriage of a princess
English text is not available in this practice contest.
A brave princess in a poor country, knowing that gambling payouts are determined by the parimutuel method, felt more familiar with gambling and was convinced of her victory in gambling. As a result, he spent more money t... | 7 | 0 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ll long long
using namespace std;
int main()
{
ll n, m;
while(cin >> n >> m, n > 0){
ll ans=0;
vector<pair<int, int>> pd;
rep(i, n){
int p, d;
cin >> d >> p;
pd.push_back(make_pair(p, d));
}
sort(pd.rbegin(), pd.rend()... | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.