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<stdio.h>
#include<map>
#include<algorithm>
int main()
{
int N,M,i,r;
while(scanf("%d%d",&N,&M),N)
{
std::pair<int,int>a[10000];
for(r=i=0;i<N;++i)scanf("%d%d",&a[i].second,&a[i].first);
std::sort(a,a+N);
for(i=N-1;i>=0;--i)
if(M>=a[i].second)M-=a[i].second;
else r+=(a[i].second-M)*a[i].first,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>
using namespace std;
typedef pair<int,int> P;
int main(){
int N, M, d, p;
while(cin >> N >> M, (N | M)){
vector<P> vec;
for(int i = 0 ; i < N ; i++){
cin >> d >> p;
vec.push_back(P(-p,d));
}
int res = 0;
sort(vec.begin(),vec.end());
for(int 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>
using namespace std;
int main(){
int n;
int m;
while( cin >> n >> m && n ){
int a[11] = {};
for( int i = 0; i < n; i++ ){
int d, p;
cin >> d >> p;
a[p] += d;
}
int result = 0;
for( int i = 10; i > 0 && m; i-- ){
while( m ){
if( a[i] > 0 ){
a[i]--;
m--;
}els... | 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;
void solve(){
Scanner sc = new Scanner(System.in);
while(true){
n = sc.nextInt();
m = sc.nextInt();
if(n==0 && m==0) break;
PriorityQueue<int[]> q
= new PriorityQueue<int[]>(n,new... | 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;
typedef pair<int,int> pii;
int N, M;
pii PD[10010];
int main() {
while (true) {
scanf("%d %d", &N, &M);
if (N == 0 && M == 0) break;
for (int i=0;i<N;i++) {
int D, P;
scanf("%d %d", &D, &P);
PD[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 <vector>
#include <algorithm>
using namespace std;
int main ()
{
int n, m;
while (cin >> n >> m, (n || m)) {
vector<pair<int,int> > v(n);
for (auto &i : v) cin >> i.second >> i.first;
sort(v.begin(), v.end());
int i = n-1;
while (m && 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 <utility>
#include <algorithm>
#include <iostream>
using namespace std;
int N,M;
pair<int,int> a[100000];
int main(){
while(cin >> N >> M){
if(N==0 && M==0){
return 0;
}
else{
for(int i=0; i<N; i++){
int d,p;
cin >> d >> p;
a[i] = make_pair(p,d);
}
sort(a, a+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 | #include<iostream>
#include<algorithm>
#include<string>
#include<fstream>
#define SIZE 9
using namespace std;
int main(){
int N,M;
int total;
int d,p;
pair<int,int>pd[10000+1];
while(cin>>N>>M,N){
total = 0;
for(int i=0; i<N; i++){
cin>>d>>p;
pd[i] = make_pair(p,d);
total += p*d;
}
sort(pd,pd+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 | #include<stdio.h>
int main(){
int n,m,d,p,a,i;
for( ; scanf("%d%d",&n,&m) , n|m ; printf("%d\n",a) ){
a=0;
int f[12]={0};
for( i=n ; i-- ; f[p] += d )
scanf("%d%d",&d,&p);
for( i=10 ; i >= 0 ; a += 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 | while True:
n,m=map(int,input().split())
if n==0:
break
else:
pdlist=[]
for i in range(0,n):
d,p=map(int,input().split())
pdlist.append([p,d])
pdlist.sort()
i=n-1
while True:
if i<0:
break
elif pd... | 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(1):
[n,m]=[int(x) for x in raw_input().split()]
if n==0:
break
else:
dlist=[]
for i in range(n):
[d,p]=[int(x) for x in raw_input().split()]
dlist.append([d,p])
dlist.sort(key=lambda x:x[1])
P=0
while(m>0 and len(dlist)>0):
... | 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 s = new Scanner(System.in);
static class Load implements Comparable<Load> {
int D;
int P;
Load(int d, int p) {
D = d;
P = p;
}
public int compareTo(Load a){
int Pa = a.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 <bits/stdc++.h>
using namespace std;
int main(void){
long long n, m;
while(cin >> n >> m, n+m){
vector<pair<int,int> > v(n);
for(int i= 0; i < n; ++i){
int a,b;
cin >> a >> b;
v.emplace_back(-b, a);
}
long long ans = 0;
sort(v.begin(), v.end());
for(int i = 0; i < n; ++i){
long long ... | 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> P;
int main() {
int N, M;
while ( cin >> N >> M, N ) {
vector<P> dat(N);
for ( int i = 0; i < N; i++ ) {
int d, p;
cin >> d >> p;
dat[i] = P(p, d);
}
sort(dat.begin(), dat.end(), greater<P>());
int an... | 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>
using namespace std;
typedef pair <int, int> P;
int main() {
int n;
long long int m;
while (cin >> n >> m) {
if (n == 0 && m == 0) {
break;
}
priority_queue<P> pq;
for (int i = 0; i < n; i++) {
P p;
cin >> p.second >> p.first;
pq.push(p);
}
while (!pq.e... | 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 n = sc.nextInt();
int m = sc.nextInt();
if(n==0 && m==0) break;
int[][] map = new int[n][2];
for(int i=0;i<n;i++){
map[i][0] = sc.nextInt();
map[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;
int N,M;
pair<int,int> PD[10010];
int main()
{
while(cin>>N>>M&&N){
int d,p,S=0;
for(int i=0;i<N;i++){
cin>>d>>p;
PD[i]=make_pair(p,d);
S+=d*p;
}
sort(PD,PD+N);
reverse(PD,PD... | 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,N) for(int i=n;i<N;i++)
#define p(S) cout<<S<<endl
using namespace std;
int main(){
int N,M;
while(cin>>N>>M&&N){
int P[11]={0};
int d,p;
long long int ans=0;
REP(i,0,N){
cin>>d>>p;
P[p]+=d;
}
for(int i=10;i>=0;i--){
if(P[i]>=M){
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 <cstdio>
#include <algorithm>
using namespace std;
int main() {
for(int tci = 0;; tci++) {
int N,M; scanf("%d%d", &N, &M); if(!N) break;
pair<int,int> *pd = new pair<int,int>[N];
int ept = 0;
for(int i = 0; i < N; i++) {
scanf("%d%d", &pd[i].second, &pd[i].first);
ept += pd[i].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 <iostream>
using namespace std;
int main(){
int n,m;
while(cin >> n >> m , n || m){
int data[11] = {0};
for(int i=0;i<n;i++){
int a,b;
cin >> a >> b;
data[b] += a;
}
for(int i=10;i>=0;i--){
if(data[i] <= m ){
m -= data[i];
data[i] = 0;
}else{
data[i] -= m;
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 | while True:
n,m =map(int, input().split())
if n==0 and m==0:
break
temp=[]
distance=0
for i in range(n):
d,p= map(int,input().split())
distance = distance + d
temp.append([p,d])
temp.sort()
temp.reverse()
if distance <= m:
print(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<utility>
#include<cmath>
using namespace std;
int main()
{
int N,M;
pair<int,int> PD[10010];
while(cin>>N>>M && N>0)
{
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;
... | 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 <algorithm>
using namespace std;
int N,M,d,p;
pair<int,int> prin[20000];
int main(){
cin >> N >> M;
while((N!=0)||(M!=0)) {
for(int i=0; i<N; ++i) {
cin >> d >> p;
prin[i] = make_pair(-p,d);
}
sort(prin,prin+N);
int money=prin[0].second;
int k = 0;
wh... | 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 | //10
#include<iostream>
#include<algorithm>
using namespace std;
struct DP{
int d,p;
bool operator<(DP a)const{
return p>a.p;
}
};
int main(){
for(int n,m;cin>>n>>m,n|m;){
DP dp[10000];
for(int i=0;i<n;i++){
cin>>dp[i].d>>dp[i].p;
}
sort(dp,dp+n);
int p=0;
for(int i=0;i<n;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 <map>
using namespace std;
int main()
{
int n,m,d,p;
for(;;){
cin >> n >> m;
if(n==0 && m==0) break;
multimap<int,int,greater<int> > mp;
while(n--){
cin >> d >> p;
mp.insert(multimap<int,int>::value_type(p,d));
}
multimap<int,int>::iterator it = mp.be... | 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 java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class Main{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-12;
int n, m;
int[] D, P;
void run(){
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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define reps(i, f, n) for (int i = f; i < (int)(n); ++i)
#define rep(i, n) reps (i, 0, n)
int main()
{
int n, m;
while(scanf("%d%d", &n, &m), n){
int p[11] = {0};
rep(i, n){
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 <utility>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
using namespace std;
int main()
{
long long n,m;
while(cin >> n >> m , !(n==0 && m==0))
{
pair<long long,long long> a[100000];
for(int i=0;i<n;i++)
{
cin >... | 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>
using namespace std;
int n,m;
int p;
int main()
{
while(cin >> n >> m && n){
pair<int,int> a[10000];
for (int i = 0; i < n; ++i)
{
cin >> a[i].second >> a[i].first;
}
sort(a,a+n);
reverse(a,a+n);
for (int 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;
int main() {
for(int N, M; cin >> N >> M && (N|M);) {
vector<pair<int,int> > v;
for(int i = 0; i < N; ++i) {
int D, P;
cin >> D >> P;
v.push_back(make_pair(P, D));
}
sort(v.begin(), v.end(), greater<pair<int,int> >());
int res = 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 |
while True:
n,m = map(int,input().split())
if n+m == 0: break
road = [list(map(int, input().split())) for _ in range(n) ]
road = sorted(road, key=lambda x:-x[1])
d = 0
for a,b in road:
if a <= m:
m -= a
else:
d += (a - m) * b
m = 0
print(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 | 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 Gamble
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader b... | 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 <map>
#include <vector>
using namespace std;
typedef pair<int,int> P;
int main(){
int n,m;
while(cin>>n>>m,n||m){
vector<P> v;
for(int i=0;i<n;++i){
int d,p;
cin >> d >> p;
v.push_back(P(p,d));
}
sort(v.begin(), v.end(), greater<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(){
long long n, m;
while (1){
cin >> n >> m;
if (n == 0 && m == 0) break;
long long dp[11] = { 0 };
long long d, p;
for (int i = 0; i < n; i++){
cin >> d >> p;
dp[p] += d;
}
long long sum = 0;
for (int i = 10; i >= 0; i--){
if (i != 0 && 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<iostream>
#include<map>
#include<queue>
#define MAX 10000
#define INF 100000000
#include<vector>
using namespace std;
typedef pair<int,int> P;
int main(){
int n,m,d,p;
while(cin>>n>>m,n||m){
priority_queue<P> que;
for(int i=0;i<n;i++){
cin>>d>>p;
que.push(P(p,d));
}
int ans=0;
while(!que.empt... | 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 fo(nn) for(int ii = 0; ii < nn; ii++)
int main(){
int n, m, D, P;
while(1){
int p[20] = {}, ans = 0;
cin>>n>>m;
if(n == 0 && m == 0) break;
fo(n){
cin>>D>>P;
p[P] += D;
}
for(int i = 10; i; i--){//cout<<ans<<" A "<<i<<" "<<p[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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N, M;
while(cin >> N >> M, N){
vector< pair<int, int> > vp(N);
int res = 0;
for(int i=0;i<N;i++){
cin >> vp[i].second >> vp[i].first;
res += vp[i].first * vp[i].second;
}
sort(vp.rbegin(), vp.rend());
f... | 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<map>
using namespace std;
int n,m;
int main()
{
while(cin>>n>>m,n)
{
int cnt[11]={};
for(int i=0;i<n;i++)
{
int d,p;cin>>d>>p;
cnt[p]+=d;
}
for(int i=10;i>=0&&m;i--)
{
if(m>cnt[i])
{
m-=cnt[i];cnt[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,d[10],a,b,t;
while (1){
for (int i=0;i<10;i++)d[i]=0;
t=0;
cin >> n >> m;
if (n==0&&m==0)break;
for (int i=0;i<n;i++) {
cin >> a >> b;
d[b-1]+=a;
}
for (int i=9;i>=0;i--){
if (m==0) break;
if (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 | import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
public class Main {
public static void main(String[] args) {
while (true) {
int N = nextInt();
if (N == 0) {
break;
}
int M = nextInt();
ArrayList<Edge> list = new ArrayList<Edge>();
for (int i = 0; i < N; ... | 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;
typedef pair<int,int> P;
int main(){
int n, m;
while(cin >> n >> m, n || m){
vector<P> v;
for(int i = 0; i < n; i++){
int d, p;
cin >> d >> p;
v.push_back(P(p, d));
}
sort(v.begin(), v.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 <cstring>
#include <iostream>
#include <queue>
using namespace std;
int main () {
long long int m;
int n;
while (cin >> n >> m, n || m) {
priority_queue<pair<int, int> > que;
for (int i = 0; i < n; i++) {
int d, p;
cin >> d >> p;
que.push(make_pair(p, d));
}
int result = 0;
while (!que.em... | 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(){
int n,m,d,p,a,i;
for( ; scanf("%d%d",&n,&m) , n|m ; printf("%d\n",a) ){
a=0;
int f[12]={0};
for( i=n ; i-- ; f[p] += d )
scanf("%d%d",&d,&p);
for( i=10 ; i >= 0 ; i-- ){
for( ; f[i] && m ; ){
m--,
f[i]--;
}
a += f[i] * 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>
using namespace std;
int main(){
int i,n,m,di,pi,o;
int p[11];
for (i=0;i<11;i++)
p[i] = 0;
while(true){
cin >> n >> m;
if (n == 0)
break;
for (i = 0;i<n;i++){
cin >> di >> pi;
p[pi] += di;
}
i = 10;
while(i>=0){
if (p[i] > m){
p[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 <iostream>
#include <algorithm>
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, greater<pair<int, int> >());
int ans = 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 "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
int mod=1e9+7;
int mod2=998244353;
signed main(){
while(true){
int n,m;
cin>>n>>m;
if(!n&&!m)break;
vector<pair<int,int> > a(n);
for(int i=0;i<n;i++){
cin>>a[i].second>>a[i].first;
}
sort(a.begin()... | 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 <algorithm>
#include <numeric>
#include <functional>
#include <math.h>
#include <stdio.h>
using namespace std;
int main(){
int n, m;
while(cin>> n >> m, n || m){
vector<int> p_freq(11);
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 | #include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int integer;
int main() {
integer n, m;
while (cin >> n >> m and n) {
vector<pair<integer,integer> > p(n);
REP(i, n) {
integer D, P;
cin >> ... | 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 {
static Scanner sc = new Scanner(System.in);
public static void main(String[] arg) {
while (true) {
int N = sc.nextInt();
if (N == 0) break;
int M = sc.nextInt();
int[] v = new int[N];
for (int i = 0; i < N; ++i) {
int D = s... | 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() {
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 * P;
Ps[P] += D;
}
fo... | 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 <algorithm>
#include <functional>
using namespace std;
typedef pair<int, int> pii;
int main()
{
int N, M, ans;
while(1){
cin >> N >> M;
if(N == 0 && M == 0){
break;
}else{
ans = 0;
pii DP[N];
for(int i = 0; i < N; i++)
cin >> DP[... | 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 <utility>
#include <algorithm>
#include <iostream>
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);
}
int S = 0 ;
for (int i = 0; i < N; ++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<algorithm>
#include<functional>
using namespace std;
typedef pair<int,int> pii;
int main(){
for(int n,m;scanf("%d%d",&n,&m),n;){
int psum=0;
static pii d_p[10000];
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... | 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 <utility>
#include <algorithm>
#include <iostream>
using namespace std;
int N,M;
pair<int,int> a[100000];
int main(){
while(cin >> N >> M){
if(N==0 && M==0){
return 0;
}
else{
for(int i=0; i<N; i++){
int d,p;
cin >> d >> p;
a[i] = make_pair(p,d);
}
sort(a, a+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 | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int main()
{
int N, M, D, P;
while (cin >> N >> M, N || M) {
vector< int > dp(11);
for (int i = 0; i < N; i++) {
cin >> D >> P;
dp[P] += D;
}
int res = 0;
for (int i = 10; i >= 0; i--) {
if (dp[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 = (int(s) for s in input().split())
if not n:
break
sections = sorted(([int(s) for s in input().split()] for i in range(n)),
key=lambda x: x[1], reverse=True)
for i, (d, p) in enumerate(sections):
m -= d
if m <= 0:
print(sum(s[... | 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 f first
#define s second
using namespace std;
int main(){
int n,m;
pair<int,int>d[10000];
while(cin>>n>>m&&n!=0){
int an=0,k=0;
for(int i=0;i<n;i++)cin>>d[i].s>>d[i].f,k+=d[i].s;
sort(d,d+n);
for(int i=0;m<k;i++){
if(k-m<d[i].s)an+=d[i].f*(k-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 | while 1:
n, m = map(int, input().split())
if n == 0:
break
data = []
for _ in range(n):
d, p = map(int, input().split())
data.append([d, p])
data = sorted(data, key=lambda x: -x[1])
for d in data:
if m <= 0:
break
if d[0] <= m:
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 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
while(true) {
int n = sc.nextInt();
if(n == 0) return;
long m = sc.nextLong();
int[][] d = new int[n][2];
for(int i=0; ... | 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.IOException;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
new Main().run();
}
private void run() throws IOException {
Scanner scanner = new Scanner(System.in);
while (true) {
int n = scanner.nextInt();
int m = scanner.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 | #include <iostream>
#include <algorithm>
#include <utility>
#define llint long long
using namespace std;
typedef pair<llint, llint> P;
llint n, m;
P p[10005];
int main(void)
{
while(1){
cin >> n >> m;
if(n == 0 && m == 0) break;
llint x, y, ans = 0;
for(int i = 1; i <= n; i++){
cin >> x >> y;
p[i] = 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,raw_input().split())
if N==M==0:break
L=[map(int,raw_input().split()) for i in range(N)]
L=[(j,i) for i,j in L]
L.sort()
L=reversed(L)
cost=0
for p,d in L:
cost+=p*(max(d-M,0))
M=max(M-d,0)
print cost | 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<iostream>
#include<map>
#include<algorithm>
using namespace std;
pair<int,int> road[10000];
int main() {
int N,M,d,p;
while(cin>>N>>M, N|M) {
for(int i=0; i<N; ++i) {
cin>>d>>p;
road[i] = pair<int,int>(p,d);
}
sort(road,road+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 | import java.util.Arrays;
import java.util.Scanner;
//Princess's Marriage
public class Main{
class P implements Comparable<P>{
int d, p;
public P(int d, int p) {
this.d = d;
this.p = p;
}
public int compareTo(P o) {
return o.p-p;
}
}
int n, m;
P[] p;
void run(){
Scanner sc = new Scanner(Sys... | 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(){
int n,m;
while(cin>>n>>m,n){
vector<int>v(11,0);
for(int i=0;i<n;++i){
int d,p;
cin>>d>>p;
v[p]+=d;
}
int ans=0;
for(int i=10;i>0;--i){
if(m>v[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 |
import java.io.*;
import java.util.*;
public class Main {
FastScanner in = new FastScanner(System.in);
PrintWriter out = new PrintWriter(System.out);
class Road implements Comparable<Road> {
int d, p;
Road(int d, int p) {
this.d = d;
this.p = p;
}
public int compareTo(Road s) {
return s.p - 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>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
while (cin >> N >> M, N) {
int D, P, res = 0, Ps[11] = {};
for (int i=0; i<N; ++i) {
cin >> D >> P;
res += 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 1:
N,M=map(int,input().split())
if not N and not M:break
s=0
t=[]
for _ in range(N):
a,b=map(int,input().split())
s+=a*b
t.extend([(b,a)])
for i in sorted(t)[::-1]:
if i[1]<=M:
s-=i[0]*i[1]
M-=i[1]
elif 0<M<i[1]:
s... | 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.*;
import static java.lang.System.*;
class Main {
public static Scanner sc = new Scanner(in);
public static Random rand=new Random();
class D{
int d;
int x;
D(int d,int x){
this.d=d;
this.x=x;
}
}
public void run() {
while(true){
int n=sc.nextInt(),m=sc.nextInt();
if(n==0... | 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 <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M, ans, d, p;
while (cin >> N >> M, N) {
vector< pair<int, int> > V;
ans = 0;
for (int i = 0; i < N; ++i) {
cin >> d >> p;
ans += d*p;
V.push_back(make_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<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n, m;
while(cin >> n >> m, n+m){
vector<pair<int,int>> v;
int d, p, sum = 0;
for(int i = 0; i < n; i++){
cin >> d >> p;
sum += p*d;
v.push_back({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>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
while(true){
int n,m;
scanf("%d%d",&n,&m);
if(n==0) break;
int o[11]={};
rep(i,n){
int d,p;
scanf("%d%d",&d,&p);
o[p]+=d;
}
int ans=0;
for(int i=10;i>=0;i--){
if(m>o[i]){
m-=o[i];
continue;
}... | 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 ALL(v) (v).begin(), (v).end()
#define INF 1e9
using namespace std;
int dist[15];
int main(){
int n, m;
while(cin >> n >> m and n + m){
REP(i, n){
int d, p;
cin >> d >> p;
dist[p] += d;
}
REP(i, 15... | 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<algorithm>
using namespace std;
int main(){
int n,m;
int d,p;
pair<int,int> v[10010];
while(cin >> n >> m, n||m){
for(int i=0;i<n;i++){
cin >> d >> p;
v[i] = make_pair(p,d);
}
sort(v,v+n);
int cnt = n-1;
while(0<=cnt && m){
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 | import sys
from operator import itemgetter
inf = 1<<30
def solve():
while 1:
N, M = map(int, sys.stdin.readline().split())
if N == M == 0:
return
sect = [tuple(list(map(int, sys.stdin.readline().split()))) for i in range(N)]
sect.sort(key=itemgetter(1), reverse=True)
... | 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;
#define rep(i, j) for(int i = 0; i < (j); i++)
int main() {
while(true) {
int N, M; cin >> N >> M;
if(N == 0) break;
vector<pair<int, int>> PD(N);
rep(i, N) cin >> PD[i].second >> PD[i].first;
sort(begin(PD), end(PD));
... | 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>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main() {
int n;
ll m;
while(cin >> n >> m, n||m) {
ll dist[11] = {};
rep(i, n) {
int d, p;
cin >> 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 <vector>
#include <string>
#include <map>
#include <algorithm>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main() {
while(1){
int n,m;
cin>>n>>m;
if(!n)break;
vector<tuple<int,int>> v;
REP(i,n){
int d,p;
cin>>d>>p;
v.empla... | 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()
{
int n,m;
for(;cin>>n>>m,n;)
{
vector<pair<int,int> > set;
for(int i=0;i<n;i++)
{
int d,p;
cin>>d>>p;
set.push_back(pair<int,int>(p,d));
}
sort(set.begin(),set.end());
int sum=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.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<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct dis{
int d, p;
};
bool s(dis const& c,dis const&b){
return c.p>b.p;
}
int n,m,a;
vector<dis>vec;
int main(){
while(cin>>n>>m,n){
vec.clear();
a=0;
for(int i=0;i<n;i++){
dis 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 == 0 and M == 0: break
travel = [list(map(int, input().split())) for _ in range(N)]
travel.sort(reverse=True, key=lambda x:x[1])
for i, (d, _) in enumerate(travel):
if M == 0: break
travel[i][0] = max(0, d-M)
M = max(0, 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<iostream>
#include<algorithm>
using namespace std;
int N, M, temp;
int i=0,ans=0;
pair<int,int> PD[10010];
int main() {
while (cin >> N >> M && N) {
int d, p;
for (int j=0; j<N; ++j) {
cin >> d >> p;
PD[j] = make_pair(p, d);
}
sort(PD,PD+N);
reverse(PD,PD+N);
while(i<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 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m;
ll ds[11];
int main(){
while(true){
scanf("%d%d", &n, &m);
if(n+m==0)return 0;
for(int i=0;i<=10;i++)ds[i]=0;
while(n--){
ll d;
int x;
scanf("%lld%d",&d,&x);
ds[x] += d;
}
ll ans = 0;
for(int i=10;i>=0;i--){
ll use = min((ll)m, ds[i]);
ds[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>
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], m);
m -= e;
sum += i*(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 | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
while(1){
int n,m,b,d[1000000]={},a,mx=0;
cin>>n>>m;
if(n+m==0) break;
for(int i=0;i<n;i++){
cin>>a>>b;
d[b]+=a;
mx=max(mx,b);
}
for(int i=mx;i>=0;i--){
if(d[i]>0 && m>0){
int t= d[i];
d[i]-=m;
m-=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 | while True:
n,m =map(int, input().split())
if n==0 and m==0:
break
a=[]
length=0
for i in range(0,n):
d,p= map(int,input().split())
length+= d
a.append([p,d])
a.sort()
a.reverse()
if length <= m:
print(0)
else:
zankin=m
flag=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>
#define MAX_P 10
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(void)
{
int N;
long M;
while(cin >> N >> M, N > 0){
long D[MAX_P + 1];
long result = 0;
//配列Dを初期化
rep(i, MAX_P + 1){
D[i] = 0;
}
//配列Dを構成
rep(i, N){
int d, p;
cin >> d >> 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 <bits/stdc++.h>
using namespace std;
const int MAX_N=1e4+10;
int N,M,D,P,ans,d;
vector<pair<int,int>> road(MAX_N);
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
while(cin >> N >> M,N){
ans=0;
for (int i=0;i<N;++i){
cin >> D >> P;
road[i]={-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 <bits/stdc++.h>
using namespace std;
int main()
{
int N, M;
while(cin >> N >> M, N || M){
int D[10001] = {0}, P[10001] = {0};
long long sum = 0;
for(int i = 0; i < N; i++) cin >> D[i] >> P[i], sum += D[i]*P[i];
while(M > 0){
int idx = max_element(P, P + N) - P;
if(P[idx] == -... | 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.*;
class Main {
public static void main(String args[]){
new Main().run();
}
Scanner sc = new Scanner(System.in);
void run(){
while(true){
int n = sc.nextInt();
int m = sc.nextInt();
if((n|m) == 0)return;
final int ds[]=new int[n];
final int ps[]=new int[n]... | 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 <vector>
#include <algorithm>
using namespace std;
typedef long long int64;
int main()
{
while(true) {
int n, m;
int64 ans = 0;
vector<pair<int, int> > dp;
scanf("%d%d", &n, &m);
if(n == 0)
break;
dp.resize(n);
for(int i = 0; i < n; ++i)
scanf("%d%d", &dp[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 <bits/stdc++.h>
using namespace std;
const int Ex = 11;
vector<int> v;
int main(){
while(1){//start
int n, m;
cin >> n >> m;
if(n == 0 and m == 0) break;
v.resize(Ex);
//input data
for(int i = 0; i < n; i++){
int d, p;
cin >> d >> p;
v[p] += d;
}
//sub
for(int i = 10; i > 0; i--){
if(m - 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<map>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int i;
int b,m,n;
map<int,int,greater<int> > a;
map<int,int,greater<int> >::iterator it;
while(cin>>n>>m&&n+m){
a.clear();
for(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>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
const int MAX_N=10000;
pair<int,int> dp [MAX_N];
int n,m;
void solve(){
sort(dp,dp+n,greater<pair<int,int> >());
for(int i=0;i<n;i++){
int tmp=dp[i].second;
if(tmp... | 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>
using namespace std;
long long N, M,sum,t;
pair <long long, long long> p[30000];
int main(){
while ((cin >> N >> M), N){
sum = 0;
for (int i = 0; i < N; i++){
cin >> p[i].second >> p[i].first;
sum += p[i].second*p[i].first;
}
sort(p, p + N);
rev... | 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 <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int N,M;
pair<int,int> p[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 <utility>
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
int N, M;
while(cin >> N >> M && N >0)
{
pair<int, int> PD[10000];
for(int i=0;i<N;i++)
cin >> PD[i].second >> PD[i].first;
sort(PD, PD+N);
int Mcur = M;
int sum = 0;
for(int 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<algorithm>
#include<vector>
#include<map>
using namespace std;
typedef pair< int , int > P;
int main(){
int N, M;
while(cin >> N >> M , N){
int d[11] = {};
for(int i = 0 ; i < N ; i++ ){
int a, b;
cin >> a >> b;
d[b] += a;
}
for(int i = 10 ; i && M ; 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 | from operator import itemgetter
#配列のソート
def protect(N,M):
DP = []
for i in range(N):
DP.append(list(map(int, input().split())))
DP.sort(key=itemgetter(1))
nokori = 0
for i in range(N):
if M > DP[N - i - 1][0]:
M -= DP[N - i - 1][0]
DP.pop()
elif M <... | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.